The following pages link to Tree-size bounded alternation (Q1145502):
Displaying 26 items.
- On efficient parallel computations of costs of paths on a grid graph (Q1824395) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Parallel pointer machines (Q2366720) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- The complexity of ranking simple languages (Q3034844) (← links)
- Constructions for alternating finite automata<sup>∗</sup> (Q3477972) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (Q3618608) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- (Q4553282) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- (Q4972729) (← links)
- Properties of probabilistic pushdown automata (Q5055907) (← links)
- Reversals and alternation (Q5096156) (← links)
- On weak growing context-sensitive grammars (Q5096331) (← links)
- Parallel recognition and ranking of context-free languages (Q5096817) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)
- Subclasses of \textsc{Ptime} interpreted by programming languages (Q6109064) (← links)
- Fast parallel hypertree decompositions in logarithmic recursion depth (Q6536399) (← links)
