Supportive oracles for parameterized polynomial-time sub-linear-space computations in relation to L, NL, and P

DOI10.1007/978-3-030-14812-6_41OpenAlexW2962785258MaRDI QIDQ2327512

Tomoyuki Yamakami

Publication date: 15 October 2019

Full work available at URL: https://arxiv.org/abs/1901.05854

zbMATH Keywords

relativizationlog-space computationparameterized decision problemsub-linear space computationsupportive oracle

Mathematics Subject Classification ID

Related Items (2)

The 2CNF Boolean formula satisfiability problem and the linear space hypothesis ⋮ Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice

This page was built for publication: Supportive oracles for parameterized polynomial-time sub-linear-space computations in relation to L, NL, and P