Misplaced Pages

The following pages link to EXPTIME

• (link count
• transclusion count
• sorted list) · See help page for transcluding these entries

Showing 50 items.

• Alternating Turing machine (links | edit)
• Computable function (links | edit)
• NL (complexity) (links | edit)
• L (complexity) (links | edit)
• FL (complexity) (links | edit)
• SL (complexity) (links | edit)
• RL (complexity) (links | edit)
• Descriptive complexity theory (links | edit)
• Automated planning and scheduling (links | edit)
• APX (links | edit)
• P/poly (links | edit)
• Parity P (links | edit)
• IP (complexity) (links | edit)
• Partially observable Markov decision process (links | edit)
• RE (complexity) (links | edit)
• R (complexity) (links | edit)
• PR (complexity) (links | edit)
• APSPACE (redirect page) (links | edit)
• Exponential running time (redirect page) (links | edit)
  • Lenstra elliptic-curve factorization (links | edit)
• NL-complete (links | edit)
• TFNP (links | edit)
• GapP (links | edit)
• Computer bridge (links | edit)
• TC0 (links | edit)
• AC0 (links | edit)
• AC (complexity) (links | edit)
• DLOGTIME (links | edit)
• ACC0 (links | edit)
• 2-EXPTIME (links | edit)
• Go and mathematics (links | edit)
• Grzegorczyk hierarchy (links | edit)
• ALL (complexity) (links | edit)
• BPL (complexity) (links | edit)
• SC (complexity) (links | edit)
• NP-completeness (links | edit)
• QMA (links | edit)
• Nested word (links | edit)
• QIP (complexity) (links | edit)
• Succinct game (links | edit)
• TC (complexity) (links | edit)
• ReDoS (links | edit)
• Exact quantum polynomial time (links | edit)
• LH (complexity) (links | edit)
• Dynamic logic (modal logic) (links | edit)
• Boolean hierarchy (links | edit)
• CC (complexity) (links | edit)
• DEXPTIME (redirect page) (links | edit)
  • Hindley–Milner type system (links | edit)
• Exponential runtime (redirect page) (links | edit)
• PL (complexity) (links | edit)
• Implicit computational complexity (links | edit)