Knowledge (XXG)

Counting problem (complexity)

Source 📝

25: 222: 307: 531: 42: 555: 89: 61: 524: 108: 68: 550: 122: 151: 75: 46: 517: 497: 57: 237: 35: 394: 427: 82: 134: 228: 126: 390: 501: 380: 339: 142: 544: 353: 466: 386: 24: 471: 457: 452: 376: 397:, problem transformations that preserve the number of solutions. 406: 18: 360:
is defined the way it is, rather than being the graph of
505: 217:{\displaystyle c_{R}(x)=\vert \{y\mid R(x,y)\}\vert \,} 240: 154: 49:. Unsourced material may be challenged and removed. 301: 216: 302:{\displaystyle \#R=\{(x,y)\mid y\leq c_{R}(x)\}} 525: 312:denotes the corresponding decision problem. 8: 296: 250: 210: 207: 180: 177: 367:, is to make this binary search possible). 532: 518: 281: 239: 213: 159: 153: 109:Learn how and when to remove this message 418: 7: 485: 483: 47:adding citations to reliable sources 556:Theoretical computer science stubs 504:. You can help Knowledge (XXG) by 393:, #P has #P-complete problems via 241: 58:"Counting problem" complexity 14: 23: 326:is a decision problem, however 123:computational complexity theory 34:needs additional citations for 293: 287: 265: 253: 204: 192: 171: 165: 1: 16:Type of computational problem 498:theoretical computer science 467:"counting complexity class" 426:Barak, Boaz (Spring 2006). 322:is a search problem while # 572: 482: 374: 371:Counting complexity class 428:"Complexity of counting" 395:parsimonious reductions 551:Computational problems 500:–related article is a 303: 218: 304: 227:is the corresponding 219: 135:computational problem 435:Princeton University 238: 152: 127:computability theory 43:improve this article 391:many-one reductions 453:"counting problem" 299: 214: 513: 512: 346:(for appropriate 229:counting function 119: 118: 111: 93: 563: 534: 527: 520: 489:P ≟ NP 484: 476: 462: 439: 438: 432: 423: 308: 306: 305: 300: 286: 285: 223: 221: 220: 215: 164: 163: 131:counting problem 114: 107: 103: 100: 94: 92: 51: 27: 19: 571: 570: 566: 565: 564: 562: 561: 560: 541: 540: 539: 538: 491: 480: 465: 451: 448: 443: 442: 430: 425: 424: 420: 415: 403: 385:Just as NP has 383: 373: 365: 331: 320: 277: 236: 235: 155: 150: 149: 115: 104: 98: 95: 52: 50: 40: 28: 17: 12: 11: 5: 569: 567: 559: 558: 553: 543: 542: 537: 536: 529: 522: 514: 511: 510: 493: 487: 478: 477: 463: 447: 446:External links 444: 441: 440: 417: 416: 414: 411: 410: 409: 402: 399: 372: 369: 363: 329: 318: 310: 309: 298: 295: 292: 289: 284: 280: 276: 273: 270: 267: 264: 261: 258: 255: 252: 249: 246: 243: 225: 224: 212: 209: 206: 203: 200: 197: 194: 191: 188: 185: 182: 179: 176: 173: 170: 167: 162: 158: 143:search problem 117: 116: 31: 29: 22: 15: 13: 10: 9: 6: 4: 3: 2: 568: 557: 554: 552: 549: 548: 546: 535: 530: 528: 523: 521: 516: 515: 509: 507: 503: 499: 494: 490: 486: 481: 474: 473: 468: 464: 460: 459: 454: 450: 449: 445: 436: 429: 422: 419: 412: 408: 405: 404: 400: 398: 396: 392: 389:problems via 388: 382: 378: 370: 368: 366: 359: 356:(the reason # 355: 354:binary search 351: 350: 345: 341: 338: 337: 332: 325: 321: 313: 290: 282: 278: 274: 271: 268: 262: 259: 256: 247: 244: 234: 233: 232: 230: 201: 198: 195: 189: 186: 183: 174: 168: 160: 156: 148: 147: 146: 144: 140: 136: 133:is a type of 132: 128: 124: 113: 110: 102: 91: 88: 84: 81: 77: 74: 70: 67: 63: 60: –  59: 55: 54:Find sources: 48: 44: 38: 37: 32:This article 30: 26: 21: 20: 506:expanding it 495: 488: 479: 470: 456: 434: 421: 384: 361: 357: 348: 347: 343: 340:Cook-reduced 335: 334: 327: 323: 316: 314: 311: 226: 138: 130: 120: 105: 99:October 2014 96: 86: 79: 72: 65: 53: 41:Please help 36:verification 33: 387:NP-complete 381:#P-complete 545:Categories 472:PlanetMath 458:PlanetMath 413:References 375:See also: 352:) using a 315:Note that 69:newspapers 275:≤ 269:∣ 242:# 187:∣ 401:See also 333:can be 83:scholar 492:  145:then 85:  78:  71:  64:  56:  496:This 431:(PDF) 141:is a 137:. If 90:JSTOR 76:books 502:stub 407:GapP 379:and 342:to # 231:and 129:, a 125:and 62:news 121:In 45:by 547:: 469:. 455:. 433:. 377:#P 533:e 526:t 519:v 508:. 475:. 461:. 437:. 364:R 362:c 358:R 349:C 344:R 336:C 330:R 328:c 324:R 319:R 317:c 297:} 294:) 291:x 288:( 283:R 279:c 272:y 266:) 263:y 260:, 257:x 254:( 251:{ 248:= 245:R 211:| 208:} 205:) 202:y 199:, 196:x 193:( 190:R 184:y 181:{ 178:| 175:= 172:) 169:x 166:( 161:R 157:c 139:R 112:) 106:( 101:) 97:( 87:· 80:· 73:· 66:· 39:.

Index


verification
improve this article
adding citations to reliable sources
"Counting problem" complexity
news
newspapers
books
scholar
JSTOR
Learn how and when to remove this message
computational complexity theory
computability theory
computational problem
search problem
counting function
Cook-reduced
binary search
#P
#P-complete
NP-complete
many-one reductions
parsimonious reductions
GapP
"Complexity of counting"
"counting problem"
PlanetMath
"counting complexity class"
PlanetMath
theoretical computer science

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.