The following pages link to Tree-size bounded alternation (Q1145502):
Displaying 50 items.
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- On the complexity of regular-grammars with integer attributes (Q632805) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Parallel parsing of tree adjoining grammars on the connection machine (Q685085) (← links)
- An NC algorithm for recognizing tree adjoining languages (Q685232) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- Effective entropies and data compression (Q751832) (← links)
- Systolic parsing of context-free languages (Q756431) (← links)
- A note on alternating on-line Turing machines (Q789181) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- Two-dimensional alternative Turing machines (Q794169) (← links)
- On the parallel recognition of unambiguous context-free languages (Q808269) (← links)
- On the complexity of the recognition of parallel 2D-image languages (Q808271) (← links)
- A note on real-time one-way alternating multicounter machines (Q809610) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Alternating simple multihead finite automata (Q1058853) (← links)
- Alternating on-line Turing machines with only universal states and small space bounds (Q1083207) (← links)
- Comparison of the power between reversal-bounded ATMs and reversal- bounded NTMs (Q1094877) (← links)
- On the complexity of parallel parsing of general context-free languages (Q1095675) (← links)
- Parallel time O(log n) recognition of unambiguous context-free languages (Q1096400) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- Decompositions of nondeterministic reductions (Q1108263) (← links)
- A parallelizable lexicographically first maximal edge-induced subgraph problem (Q1108808) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (Q1124332) (← links)
- On the relationship of congruence closure and unification (Q1124338) (← links)
- Three-dimensional alternating Turing machines with only universal states (Q1129412) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- On uniform circuit complexity (Q1152951) (← links)
- Pebbling with an auxiliary pushdown (Q1156489) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- Upper bounds on recognition of a hierarchy of non-context-free languages (Q1193884) (← links)
- Relating attribute grammars and lexical-functional grammars (Q1194806) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- Properties of probabilistic pushdown automata (Q1274989) (← links)
- Restricted CRCW PRAMs (Q1314395) (← links)
- Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines (Q1323339) (← links)
- On 1-inkdot alternating Turing machines with small space (Q1325841) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- Growing context-sensitive languages and Church-Rosser languages (Q1383712) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- A leaf-time hierarchy of two-dimensional alternating turing machines (Q1822969) (← links)
