Pages that link to "Item:Q4608568"
From MaRDI portal
The following pages link to Trading determinism for time in space bounded computations (Q4608568):
Displaying 11 items.
- If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n (Q914371) (← links)
- Determinism versus nondeterminism for linear time RAMs with memory restrictions (Q1869934) (← links)
- Making Nondeterminism Unambiguous (Q4943859) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- (Q5002753) (← links)
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (Q5089210) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q5402558) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
- Pseudodeterministic algorithms and the structure of probabilistic time (Q6087003) (← links)