Recommendations
- On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions
- Rational transductions and complexity of counting problems
- Ranking and formal power series
- On languages accepted with simultaneous complexity bounds and their ranking problem
- Ranking and unranking left szilard languages
Cites work
- k + 1 Heads Are Better than k
- A taxonomy of problems with fast parallel algorithms
- Alternation
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Finite-Turn Pushdown Automata
- scientific article; zbMATH DE number 4033108 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3560742 (Why is no real title available?)
- scientific article; zbMATH DE number 3302285 (Why is no real title available?)
- On pebble automata
- On uniform circuit complexity
- Parallelism in random access machines
- Path Systems: Constructions, Solutions and Applications
- Simulation of Parallel Random Access Machines by Circuits
- The complexity of computing the permanent
- Tree-size bounded alternation
Cited in
(21)- On sets polynomially enumerable by iteration
- Polynomial-time compression
- A very hard log-space counting class
- Non-commutative arithmetic circuits: depth reduction and size lower bounds
- The complexity of computing maximal word functions
- Recursion-theoretic ranking and compression
- How hard is computing the edit distance?
- Computing a context-free grammar-generating series
- Closure and nonclosure properties of the classes of compressible and rankable sets
- scientific article; zbMATH DE number 512837 (Why is no real title available?)
- CONSTRUCTING LANGUAGE INSTANCES BASED ON PARTIAL INFORMATION
- Ranking and unranking left szilard languages
- scientific article; zbMATH DE number 1869614 (Why is no real title available?)
- Rational transductions and complexity of counting problems
- How hard is to compute the edit distance
- Parallel recognition and ranking of context-free languages
- Rational transductions and complexity of counting problems
- On languages accepted with simultaneous complexity bounds and their ranking problem
- On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions
- Bounded length UCFG equivalence
- On the complexity of ranking
This page was built for publication: The complexity of ranking simple languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034844)
