Pages that link to "Item:Q3976039"

The following pages link to Minimal notrivial space complexity of probabilistic one-way Turing machines (Q3976039):

Displaying 18 items.

• Automaticity. IV: Sequences, sets, and diversity (Q679096) (← links)
• A note on off-line machines with 'Brownian' input heads (Q801900) (← links)
• Theory of one-tape linear-time Turing machines (Q1041220) (← links)
• Geometric problems on two-dimensional array processors (Q1104746) (← links)
• With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy (Q1118405) (← links)
• Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
• Automaticity. II: Descriptional complexity in the unary case (Q1390867) (← links)
• Computational power of one-way Turing machines with sublogarithmic memory restrictions (Q2262923) (← links)
• A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
• One-way bounded-error probabilistic pushdown automata and Kolmogorov complexity (preliminary report) (Q2408814) (← links)
• A space lower bound for acceptance by one-way \(\Pi_2\)-alternating machines (Q2720409) (← links)
• Hartmanis-Stearns Conjecture on Real Time and Transcendence (Q2891306) (← links)
• Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines (Q3172836) (← links)
• Complexity of probabilistic versus deterministic automata (Q4560366) (← links)
• Lower space bounds for randomized computation (Q4632458) (← links)
• Lower time bounds for randomized computation (Q4645177) (← links)
• Uncountable classical and quantum complexity classes (Q5223610) (← links)
• Minimal cover-automata for finite languages (Q5958721) (← links)