Pages that link to "Item:Q1167537"
From MaRDI portal
The following pages link to Symmetric space-bounded computation (Q1167537):
Displaying 34 items.
- Inequalities for the number of walks in graphs (Q378237) (← links)
- Matrix power inequalities and the number of walks in graphs (Q403573) (← links)
- CNF and DNF succinct graph encodings (Q515682) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Knapsack problems for NL (Q673615) (← links)
- Reversible simulation of space-bounded computations (Q673645) (← links)
- Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Complexity of the word problem for commutative semigroups of fixed dimension (Q802020) (← links)
- The complexity of pure literal elimination (Q862401) (← links)
- Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223) (← links)
- Space-bounded hierarchies and probabilistic computations (Q1062759) (← links)
- Complete problems for symmetric logspace involving free groups (Q1183484) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
- Using the Hamiltonian path operator to capture NP (Q1198664) (← links)
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\) (Q1288206) (← links)
- Completeness results for graph isomorphism. (Q1401960) (← links)
- Complexity of path discovery game problems (Q1566737) (← links)
- Reversible space equals deterministic space (Q1567403) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Towards efficient universal planning: A randomized approach (Q1978311) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- Feasibility checking in Horn constraint systems through a reduction based approach (Q2344728) (← links)
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace (Q2410679) (← links)
- A combinatorial algorithm for Horn programs (Q2445839) (← links)
- Reversibility in space-bounded computation (Q2930716) (← links)
- (Q5002644) (← links)
- An unambiguous class possessing a complete set (Q5048936) (← links)
- Cyclic Extensions of Order Varieties (Q5415613) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
