Pages that link to "Item:Q4185825"
From MaRDI portal
The following pages link to Log Space Recognition and Translation of Parenthesis Languages (Q4185825):
Displayed 28 items.
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
- Consistency in nondeterministic storage (Q1060847) (← links)
- Space-bounded hierarchies and probabilistic computations (Q1062759) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- Decompositions of nondeterministic reductions (Q1108263) (← links)
- A space efficient algorithm for the monotone planar circuit value problem (Q1133895) (← links)
- On truth-table reducibility to SAT (Q1173957) (← links)
- Generic oracles, uniform machines, and codes (Q1184732) (← links)
- Lower bounds on space complexity for contextfree recognition (Q1251077) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Bi-Lipschitz bijection between the Boolean cube and the Hamming ball (Q2630133) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (Q2891374) (← links)
- On the Complexity of the Model Checking Problem (Q3176188) (← links)
- First-Order Model Checking Problems Parameterized by the Model (Q3507457) (← links)
- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions (Q3584967) (← links)
- Relativization of questions about log space computability (Q4109299) (← links)
- On strict interpretations of grammar forms (Q4199558) (← links)
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (Q4982126) (← links)
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
- The lattice and semigroup structure of multipermutations (Q5063206) (← links)
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
- (Q5136328) (← links)