544:
105:
573:
17:
537:
467:
98:
21:
568:
530:
510:
563:
91:
290:
483:
472:
426:
421:
416:
411:
431:
285:
217:
207:
114:
29:
320:
390:
380:
337:
327:
310:
300:
258:
253:
248:
232:
212:
190:
185:
180:
168:
163:
158:
153:
45:
514:
385:
273:
195:
148:
73:
557:
78:
263:
173:
63:. It is the largest complexity class, containing all other complexity classes.
375:
200:
370:
365:
360:
305:
128:
355:
315:
462:
457:
332:
83:
43:
contains all of the complex classes of decision problems, including
452:
447:
268:
51:
280:
138:
87:
295:
227:
222:
143:
133:
518:
440:
404:
348:
241:
121:
55:, and uncountably many languages that are neither
538:
99:
8:
545:
531:
106:
92:
84:
7:
498:
496:
574:Theoretical computer science stubs
14:
468:Probabilistically checkable proof
1:
517:. You can help Knowledge by
511:theoretical computer science
590:
495:
484:List of complexity classes
36:Relations to other classes
481:
473:Interactive proof system
513:–related article is a
427:Arithmetical hierarchy
422:Grzegorczyk hierarchy
417:Exponential hierarchy
349:Considered infeasible
569:Undecidable problems
412:Polynomial hierarchy
242:Suspected infeasible
28:is the class of all
441:Families of classes
122:Considered feasible
564:Complexity classes
115:Complexity classes
526:
525:
490:
489:
432:Boolean hierarchy
405:Class hierarchies
30:decision problems
22:complexity theory
581:
547:
540:
533:
502:P ≟ NP
497:
108:
101:
94:
85:
589:
588:
584:
583:
582:
580:
579:
578:
554:
553:
552:
551:
504:
493:
491:
486:
477:
436:
400:
344:
338:PSPACE-complete
237:
117:
112:
69:
38:
12:
11:
5:
587:
585:
577:
576:
571:
566:
556:
555:
550:
549:
542:
535:
527:
524:
523:
506:
500:
488:
487:
482:
479:
478:
476:
475:
470:
465:
460:
455:
450:
444:
442:
438:
437:
435:
434:
429:
424:
419:
414:
408:
406:
402:
401:
399:
398:
393:
388:
383:
378:
373:
368:
363:
358:
352:
350:
346:
345:
343:
342:
341:
340:
330:
325:
324:
323:
313:
308:
303:
298:
293:
288:
283:
278:
277:
276:
274:co-NP-complete
271:
266:
261:
251:
245:
243:
239:
238:
236:
235:
230:
225:
220:
215:
210:
205:
204:
203:
193:
188:
183:
178:
177:
176:
166:
161:
156:
151:
146:
141:
136:
131:
125:
123:
119:
118:
113:
111:
110:
103:
96:
88:
82:
81:
74:Complexity Zoo
68:
67:External links
65:
37:
34:
13:
10:
9:
6:
4:
3:
2:
586:
575:
572:
570:
567:
565:
562:
561:
559:
548:
543:
541:
536:
534:
529:
528:
522:
520:
516:
512:
507:
503:
499:
494:
485:
480:
474:
471:
469:
466:
464:
461:
459:
456:
454:
451:
449:
446:
445:
443:
439:
433:
430:
428:
425:
423:
420:
418:
415:
413:
410:
409:
407:
403:
397:
394:
392:
389:
387:
384:
382:
379:
377:
374:
372:
369:
367:
364:
362:
359:
357:
354:
353:
351:
347:
339:
336:
335:
334:
331:
329:
326:
322:
319:
318:
317:
314:
312:
309:
307:
304:
302:
299:
297:
294:
292:
289:
287:
284:
282:
279:
275:
272:
270:
267:
265:
262:
260:
257:
256:
255:
252:
250:
247:
246:
244:
240:
234:
231:
229:
226:
224:
221:
219:
216:
214:
211:
209:
206:
202:
199:
198:
197:
194:
192:
189:
187:
184:
182:
179:
175:
172:
171:
170:
167:
165:
162:
160:
157:
155:
152:
150:
147:
145:
142:
140:
137:
135:
132:
130:
127:
126:
124:
120:
116:
109:
104:
102:
97:
95:
90:
89:
86:
80:
76:
75:
71:
70:
66:
64:
62:
58:
54:
53:
48:
47:
42:
35:
33:
31:
27:
23:
19:
18:computability
519:expanding it
508:
501:
492:
395:
72:
60:
56:
50:
44:
40:
39:
25:
15:
321:#P-complete
259:NP-complete
174:NL-complete
558:Categories
376:ELEMENTARY
201:P-complete
371:2-EXPTIME
79:Class ALL
366:EXPSPACE
361:NEXPTIME
129:DLOGTIME
356:EXPTIME
264:NP-hard
505:
463:NSPACE
458:DSPACE
333:PSPACE
509:This
453:NTIME
448:DTIME
269:co-NP
61:co-RE
52:co-RE
515:stub
281:TFNP
59:nor
49:and
20:and
396:ALL
296:QMA
286:FNP
228:APX
223:BQP
218:BPP
208:ZPP
139:ACC
41:ALL
26:ALL
16:In
560::
391:RE
381:PR
328:IP
316:#P
311:PP
306:⊕P
301:PH
291:AM
254:NP
249:UP
233:FP
213:RP
191:CC
186:SC
181:NC
169:NL
164:FL
159:RL
154:SL
144:TC
134:AC
77::
57:RE
46:RE
32:.
24:,
546:e
539:t
532:v
521:.
386:R
196:P
149:L
107:e
100:t
93:v
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.