Pages that link to "Item:Q1312179"
From MaRDI portal
The following pages link to The relative power of logspace and polynomial time reductions (Q1312179):
Displaying 9 items.
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- Decompositions of nondeterministic reductions (Q1108263) (← links)
- Rudimentary reductions revisited (Q1183444) (← links)
- The structure of logarithmic advice complexity classes (Q1275000) (← links)
- Non-uniform reductions (Q1959376) (← links)
- Logspace Reducibility: Models and Equivalences (Q4341044) (← links)
- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines (Q4723306) (← links)
- Theory and Applications of Satisfiability Testing (Q5713724) (← links)