Pages that link to "Item:Q1208403"
From MaRDI portal
The following pages link to A very hard log-space counting class (Q1208403):
Displaying 47 items.
- On parallel complexity of analytic functions (Q388112) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- \textsc{ReachFewL} = \textsc{ReachUL} (Q744612) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- A note on SpanP functions (Q1328756) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Recursion-theoretic ranking and compression (Q1713478) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- A note on logspace optimization (Q1904668) (← links)
- On the power of unambiguity in log-space (Q1926109) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Closure and nonclosure properties of the classes of compressible and rankable sets (Q2037201) (← links)
- Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- On the connection between interval size functions and path counting (Q2410681) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs (Q2821694) (← links)
- Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems (Q2867130) (← links)
- The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
- Evaluating Matrix Circuits (Q3196387) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Structure and importance of logspace-MOD class (Q4009813) (← links)
- Adaptive logspace reducibility and parallel time (Q4327383) (← links)
- Federation and Navigation in SPARQL 1.1 (Q4647814) (← links)
- Rational transductions and complexity of counting problems (Q4850332) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- NL-printable sets and Nondeterministic Kolmogorov Complexity (Q4924524) (← links)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334) (← links)
- How hard is to compute the edit distance (Q5055912) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- Rational transductions and complexity of counting problems (Q5096829) (← links)
- On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881) (← links)
- Parallel Computation Using Active Self-assembly (Q5168495) (← links)
- Completeness Results for Counting Problems with Easy Decision (Q5283355) (← links)
- FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS (Q5495421) (← links)
- Parallel algorithms for power circuits and the word problem of the Baumslag group (Q6083216) (← links)
- Power of counting by nonuniform families of polynomial-size finite automata (Q6546609) (← links)
