43:
is different from co-NP, then all of the co-NP-complete problems are not solvable in polynomial time. If there exists a way to solve a co-NP-complete problem quickly, then that algorithm can be used to solve all co-NP problems quickly.
155:
formula is a tautology; that is, whether every possible assignment of true/false values to variables yields a true statement. This is closely related to the
39:, in the sense that any problem in co-NP can be reformulated as a special case of any co-NP-complete problem with only polynomial overhead. If
288:
237:
116:
650:
281:
28:
156:
685:
274:
666:
473:
17:
655:
71:. However, it is not known if the sets are equal, although inequality is thought more likely. See
152:
48:
180:
609:
604:
599:
68:
594:
93:
8:
614:
233:
148:
578:
468:
400:
390:
297:
261:
203:
195:
105:
573:
563:
520:
510:
503:
493:
483:
441:
436:
431:
415:
395:
373:
368:
363:
351:
346:
341:
336:
227:
88:
83:
56:
568:
378:
331:
256:
123:, there exists a polynomial time algorithm which can transform any instance of
64:
40:
679:
446:
356:
132:
76:
52:
558:
383:
553:
266:
208:
199:
548:
543:
488:
311:
538:
645:
640:
515:
498:
135:. As a consequence, if we had a polynomial time algorithm for
635:
630:
451:
112:
72:
60:
36:
463:
321:
478:
410:
405:
326:
316:
139:, we could solve all co-NP problems in polynomial time.
86:is co-NP-complete (or even just co-NP-hard), then
677:
119:to it. This means that for every co-NP problem
282:
151:, the problem of determining whether a given
147:One example of a co-NP-complete problem is
35:are those that are the hardest problems in
289:
275:
225:
55:problem. There are some problems in both
221:
219:
207:
178:
14:
678:
296:
216:
270:
163:such assignment, and is NP-complete.
229:Complexity Theory: A Modern Approach
226:Arora, Sanjeev; Barak, Boaz (2009).
99:
82:Fortune showed in 1979 that if any
47:Each co-NP-complete problem is the
24:
159:, which asks whether there exists
117:polynomial-time many-one reducible
31:, computational problems that are
25:
697:
651:Probabilistically checkable proof
249:
115:and if every problem in co-NP is
181:"A Note on Sparse Complete Sets"
232:. Cambridge University Press.
172:
157:Boolean satisfiability problem
111:is co-NP-complete if it is in
63:, for example all problems in
13:
1:
166:
92:, a critical foundation for
7:
10:
702:
667:List of complexity classes
142:
664:
623:
587:
531:
424:
304:
188:SIAM Journal on Computing
656:Interactive proof system
610:Arithmetical hierarchy
605:Grzegorczyk hierarchy
600:Exponential hierarchy
532:Considered infeasible
69:integer factorization
595:Polynomial hierarchy
425:Suspected infeasible
179:Fortune, S. (1979).
127:into an instance of
624:Families of classes
305:Considered feasible
686:Complexity classes
298:Complexity classes
79:for more details.
673:
672:
615:Boolean hierarchy
588:Class hierarchies
239:978-0-521-42426-4
100:Formal definition
94:Mahaney's theorem
29:complexity theory
16:(Redirected from
693:
291:
284:
277:
268:
267:
244:
243:
223:
214:
213:
211:
185:
176:
106:decision problem
91:
21:
701:
700:
696:
695:
694:
692:
691:
690:
676:
675:
674:
669:
660:
619:
583:
527:
521:PSPACE-complete
420:
300:
295:
252:
247:
240:
224:
217:
200:10.1137/0208034
183:
177:
173:
169:
145:
102:
87:
84:sparse language
23:
22:
15:
12:
11:
5:
699:
689:
688:
671:
670:
665:
662:
661:
659:
658:
653:
648:
643:
638:
633:
627:
625:
621:
620:
618:
617:
612:
607:
602:
597:
591:
589:
585:
584:
582:
581:
576:
571:
566:
561:
556:
551:
546:
541:
535:
533:
529:
528:
526:
525:
524:
523:
513:
508:
507:
506:
496:
491:
486:
481:
476:
471:
466:
461:
460:
459:
457:co-NP-complete
454:
449:
444:
434:
428:
426:
422:
421:
419:
418:
413:
408:
403:
398:
393:
388:
387:
386:
376:
371:
366:
361:
360:
359:
349:
344:
339:
334:
329:
324:
319:
314:
308:
306:
302:
301:
294:
293:
286:
279:
271:
265:
264:
257:Complexity Zoo
251:
250:External links
248:
246:
245:
238:
215:
194:(3): 431–433.
170:
168:
165:
144:
141:
131:with the same
101:
98:
33:co-NP-complete
9:
6:
4:
3:
2:
698:
687:
684:
683:
681:
668:
663:
657:
654:
652:
649:
647:
644:
642:
639:
637:
634:
632:
629:
628:
626:
622:
616:
613:
611:
608:
606:
603:
601:
598:
596:
593:
592:
590:
586:
580:
577:
575:
572:
570:
567:
565:
562:
560:
557:
555:
552:
550:
547:
545:
542:
540:
537:
536:
534:
530:
522:
519:
518:
517:
514:
512:
509:
505:
502:
501:
500:
497:
495:
492:
490:
487:
485:
482:
480:
477:
475:
472:
470:
467:
465:
462:
458:
455:
453:
450:
448:
445:
443:
440:
439:
438:
435:
433:
430:
429:
427:
423:
417:
414:
412:
409:
407:
404:
402:
399:
397:
394:
392:
389:
385:
382:
381:
380:
377:
375:
372:
370:
367:
365:
362:
358:
355:
354:
353:
350:
348:
345:
343:
340:
338:
335:
333:
330:
328:
325:
323:
320:
318:
315:
313:
310:
309:
307:
303:
299:
292:
287:
285:
280:
278:
273:
272:
269:
263:
259:
258:
254:
253:
241:
235:
231:
230:
222:
220:
210:
205:
201:
197:
193:
189:
182:
175:
171:
164:
162:
158:
154:
150:
140:
138:
134:
130:
126:
122:
118:
114:
110:
107:
97:
95:
90:
85:
80:
78:
74:
70:
66:
62:
58:
54:
50:
45:
42:
38:
34:
30:
19:
456:
255:
228:
191:
187:
174:
161:at least one
160:
146:
136:
128:
124:
120:
108:
103:
81:
46:
32:
26:
504:#P-complete
442:NP-complete
357:NL-complete
133:truth value
77:NP-complete
53:NP-complete
559:ELEMENTARY
384:P-complete
167:References
49:complement
554:2-EXPTIME
209:1813/7473
149:tautology
18:CoNP-hard
680:Category
549:EXPSPACE
544:NEXPTIME
312:DLOGTIME
539:EXPTIME
447:NP-hard
153:Boolean
143:Example
646:NSPACE
641:DSPACE
516:PSPACE
236:
89:P = NP
51:of an
636:NTIME
631:DTIME
452:co-NP
262:coNPC
184:(PDF)
113:co-NP
73:co-NP
61:co-NP
37:co-NP
464:TFNP
234:ISBN
75:and
59:and
579:ALL
479:QMA
469:FNP
411:APX
406:BQP
401:BPP
391:ZPP
322:ACC
204:hdl
196:doi
67:or
27:In
682::
574:RE
564:PR
511:IP
499:#P
494:PP
489:⊕P
484:PH
474:AM
437:NP
432:UP
416:FP
396:RP
374:CC
369:SC
364:NC
352:NL
347:FL
342:RL
337:SL
327:TC
317:AC
260::
218:^
202:.
190:.
186:.
104:A
96:.
57:NP
569:R
379:P
332:L
290:e
283:t
276:v
242:.
212:.
206::
198::
192:8
137:C
129:C
125:L
121:L
109:C
65:P
41:P
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.