Pages that link to "Item:Q4315092"

The following pages link to RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS (Q4315092):

Displaying 25 items.

• Relativizing small complexity classes and their theories (Q260396) (← links)
• A characterization of the leaf language classes (Q287160) (← links)
• Leaf languages and string compression (Q550251) (← links)
• Helping by unambiguous computation and probabilistic computation (Q675865) (← links)
• Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
• Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
• Constructive complexity (Q1182305) (← links)
• A uniform approach to define complexity classes (Q1200807) (← links)
• Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
• Relating polynomial time to constant depth (Q1274992) (← links)
• Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
• Reducing the number of solutions of NP functions (Q1608321) (← links)
• Functions computable in polynomial space (Q1775891) (← links)
• Complexity limitations on quantum computation (Q1961375) (← links)
• Machines that can output empty words (Q2272215) (← links)
• Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
• LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
• A reducibility for the dot-depth hierarchy (Q2575760) (← links)
• Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
• (Q4694254) (← links)
• Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
• Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria (Q5055938) (← links)
• SELF-SPECIFYING MACHINES (Q5249003) (← links)
• A relationship between difference hierarchies and relativized polynomial hierarchies (Q5289273) (← links)
• Dot operators (Q5958134) (← links)