The following pages link to Turing machines that take advice (Q787674):
Displaying 50 items.
- Reactive Turing machines (Q393091) (← links)
- Interpolation in Valiant's theory (Q451113) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Optimal advice (Q672755) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Two-way non-uniform finite automata (Q832933) (← links)
- \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← links)
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- On hiding information from an oracle (Q1263281) (← links)
- Boolean operations, joins, and the extended low hierarchy (Q1275091) (← links)
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) (← links)
- Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
- On reductions of NP sets to sparse sets (Q1329162) (← links)
- Analog computation via neural networks (Q1331940) (← links)
- Hardness vs randomness (Q1337458) (← links)
- Separation of complexity classes in Koiran's weak model (Q1338212) (← links)
- Quasi-linear truth-table reductions to \(p\)-selective sets (Q1351469) (← links)
- Resolution of Hartmanis' conjecture for NL-hard sparse sets (Q1575434) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- Multi-head finite automata: Data-independent versus data-dependent computations (Q1608894) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- Catalytic space: non-determinism and hierarchy (Q1702851) (← links)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time. (Q1872732) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
- Amount of nonconstructivity in deterministic finite automata (Q1959651) (← links)
- Towards efficient universal planning: A randomized approach (Q1978311) (← links)
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games (Q2012178) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Boolean functional synthesis: hardness and practical algorithms (Q2050108) (← links)
- On the amount of nonconstructivity in learning formal languages from text (Q2051759) (← links)
- Advice hierarchies among finite automata (Q2084773) (← links)
- Nonuniform reductions and NP-completeness (Q2158296) (← links)
- Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata (Q2164011) (← links)
- Synthesis of succinct systems (Q2353397) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Robust simulations and significant separations (Q2407096) (← links)
- Question answering by humans and machines: a complexity-theoretic view (Q2422044) (← links)
- In defense of PDDL axioms (Q2457650) (← links)
- Large finite structures with few \(L^k\)-types (Q2506492) (← links)
- On the typical case complexity of graph optimization (Q2581548) (← links)
- Self-reducibility (Q2639637) (← links)
- Multiple Usage of Random Bits in Finite Automata (Q2898066) (← links)
