173:
108:
67:
242:
408:
309:
237:
427:
401:
50:
208:
155:
94:
129:
80:
17:
133:
394:
374:
32:
432:
118:
137:
122:
260:
250:
304:
235:
Allender, E.; Strauss, M. (1994), "Measure on small complexity classes with applications for BPP",
86:
378:
328:
290:
269:
28:
21:
222:
349:
295:
172:
421:
333:
307:; Tardos, G. (1989), "Decision versus search problems in super-polynomial time",
107:
354:
246:
319:
Watanabe, O. (1987), "Comparison of polynomial time completeness notions",
46:
273:
36:
167:
101:
60:
258:
Book, R. (1972), "On languages accepted in polynomial time",
35:
in time 2 and is therefore equal to the complexity class
382:
184:
281:Book, R. (1974), "Comparing complexity classes",
402:
8:
136:. Unsourced material may be challenged and
95:Learn how and when to remove these messages
409:
395:
332:
294:
209:Learn how and when to remove this message
156:Learn how and when to remove this message
283:Journal of Computer and System Sciences
7:
362:
360:
134:adding citations to reliable sources
51:polynomial-time many-one reductions
428:Theoretical computer science stubs
381:. You can help Knowledge (XXG) by
14:
76:This section has multiple issues.
171:
106:
65:
84:or discuss these issues on the
18:computational complexity theory
1:
310:Proceedings of IEEE FOCS 1989
296:10.1016/s0022-0000(74)80008-5
57:Relationship to other classes
375:theoretical computer science
334:10.1016/0304-3975(87)90132-0
321:Theoretical Computer Science
33:deterministic Turing machine
238:Proceedings of IEEE FOCS'94
45:, unlike the similar class
449:
359:
261:SIAM Journal on Computing
31:that can be solved by a
377:–related article is a
49:, is not closed under
241:, pp. 807–818,
130:improve this section
433:Complexity classes
313:, pp. 222–227
221:E is contained by
183:. You can help by
390:
389:
219:
218:
211:
201:
200:
166:
165:
158:
99:
29:decision problems
440:
411:
404:
397:
366:P ≟ NP
361:
337:
336:
327:(2–3): 249–265,
314:
299:
298:
276:
253:
214:
207:
196:
193:
175:
168:
161:
154:
150:
147:
141:
110:
102:
91:
69:
68:
61:
22:complexity class
448:
447:
443:
442:
441:
439:
438:
437:
418:
417:
416:
415:
368:
345:
318:
305:Impagliazzo, R.
303:
280:
274:10.1137/0201019
257:
234:
231:
215:
204:
203:
202:
197:
191:
188:
181:needs expansion
162:
151:
145:
142:
127:
111:
70:
66:
59:
12:
11:
5:
446:
444:
436:
435:
430:
420:
419:
414:
413:
406:
399:
391:
388:
387:
370:
364:
358:
357:
350:Complexity Zoo
344:
343:External links
341:
340:
339:
316:
301:
289:(9): 213–229,
278:
268:(4): 281–287,
255:
230:
227:
217:
216:
199:
198:
178:
176:
164:
163:
114:
112:
105:
100:
74:
73:
71:
64:
58:
55:
27:is the set of
13:
10:
9:
6:
4:
3:
2:
445:
434:
431:
429:
426:
425:
423:
412:
407:
405:
400:
398:
393:
392:
386:
384:
380:
376:
371:
367:
363:
356:
352:
351:
347:
346:
342:
335:
330:
326:
322:
317:
312:
311:
306:
302:
297:
292:
288:
284:
279:
275:
271:
267:
263:
262:
256:
252:
248:
244:
240:
239:
233:
232:
228:
226:
224:
213:
210:
195:
192:February 2023
186:
182:
179:This section
177:
174:
170:
169:
160:
157:
149:
146:February 2023
139:
135:
131:
125:
124:
120:
115:This section
113:
109:
104:
103:
98:
96:
89:
88:
83:
82:
77:
72:
63:
62:
56:
54:
52:
48:
44:
40:
38:
34:
30:
26:
23:
19:
383:expanding it
372:
365:
348:
324:
320:
308:
286:
282:
265:
259:
236:
220:
205:
189:
185:adding to it
180:
152:
143:
128:Please help
116:
92:
85:
79:
78:Please help
75:
42:
41:
24:
15:
422:Categories
229:References
81:improve it
249:, DIMACS
117:does not
87:talk page
251:TR 94-18
247:TR94-004
355:Class E
138:removed
123:sources
47:EXPTIME
369:
245:
20:, the
373:This
39:(2).
37:DTIME
379:stub
243:ECCC
121:any
119:cite
329:doi
291:doi
270:doi
187:.
132:by
16:In
424::
353::
325:54
323:,
285:,
264:,
225:.
223:NE
90:.
53:.
410:e
403:t
396:v
385:.
338:.
331::
315:.
300:.
293::
287:3
277:.
272::
266:1
254:.
212:)
206:(
194:)
190:(
159:)
153:(
148:)
144:(
140:.
126:.
97:)
93:(
43:E
25:E
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
