Pages that link to "Item:Q1200807"

The following pages link to A uniform approach to define complexity classes (Q1200807):

Displaying 40 items.

• A characterization of the leaf language classes (Q287160) (← links)
• Leaf languages and string compression (Q550251) (← links)
• Succinct circuit representations and leaf language classes are basically the same concept (Q671606) (← links)
• On the acceptance power of regular languages (Q672323) (← links)
• Helping by unambiguous computation and probabilistic computation (Q675865) (← links)
• Lower bounds and the hardness of counting properties (Q703531) (← links)
• Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
• Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
• Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
• Separating complexity classes with tally oracles (Q1185002) (← links)
• Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
• Relating polynomial time to constant depth (Q1274992) (← links)
• Nondeterministic \(NC^1\) computation (Q1276170) (← 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)
• A model-theoretic characterization of the weak pigeonhole principle (Q1849868) (← links)
• The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
• Machines that can output empty words (Q2272215) (← links)
• Reductions between disjoint NP-pairs (Q2387199) (← links)
• Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
• A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
• Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
• Structures interpretable in models of bounded arithmetic (Q2570136) (← links)
• A reducibility for the dot-depth hierarchy (Q2575760) (← links)
• Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
• Immunity and Simplicity for Exact Counting and Other Counting Classes (Q4265536) (← links)
• UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)
• On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893) (← links)
• Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
• On balanced versus unbalanced computation trees (Q4887490) (← links)
• (Q5005153) (← links)
• Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria (Q5055938) (← links)
• (Q5092480) (← links)
• LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY (Q5248979) (← links)
• SELF-SPECIFYING MACHINES (Q5249003) (← links)
• Approximate counting in bounded arithmetic (Q5422312) (← links)
• THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS (Q5462667) (← links)
• Dot operators (Q5958134) (← links)
• Relations among parallel and sequential computation models (Q6560351) (← links)