Adaptive logspace reducibility and parallel time

@article{lvarez2005AdaptiveLR,
  title={Adaptive logspace reducibility and parallel time},
  author={C. {\`A}lvarez and J. Balc{\'a}zar and Birgit Jenner},
  journal={Mathematical systems theory},
  year={2005},
  volume={28},
  pages={117-140}
}
We discuss two notions of functional oracle for logarithmic space-bounded machines, which differ in whether there is only one oracle tape for both the query and the answer or a separate tape for the answer, which can still be read while the next query is already being constructed. The first notion turns out to be basically nonadaptive, behaving like access to an oracle set. The second notion, on the other hand, is adaptive. By imposing appropriate bounds on the number of functional oracle… Expand
Equivalence Problems for Circuits over Sets of Natural Numbers
A note on logspace optimization
On expressive power of regular realizability problems
  • M. Vyalyi
  • Mathematics, Computer Science
  • Probl. Inf. Transm.
  • 2013
Reductions to Graph Isomorphism
  • J. Torán
  • Computer Science, Mathematics
  • Theory of Computing Systems
  • 2008
Reductions to Graph Isomorphism
  • J. Torán
  • Computer Science, Mathematics
  • FSTTCS
  • 2007
On complexity of regular realizability problems
  • M. Vyalyi
  • Mathematics, Computer Science
  • ArXiv
  • 2012
Multiobjective Optimization and Language Equations
Universality of Regular Realizability Problems
  • M. Vyalyi
  • Mathematics, Computer Science
  • CSR
  • 2013

References

SHOWING 1-10 OF 25 REFERENCES
Bounded Query Classes
  • K. Wagner
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1990
Relativization of questions about log space computability
A very hard log space counting class
  • C. Àlvarez, Birgit Jenner
  • Mathematics, Computer Science
  • Proceedings Fifth Annual Structure in Complexity Theory Conference
  • 1990
Two applications of complementation via inductive counting
Comparison of polynomial-time reducibilities
On Uniform Circuit Complexity
  • W. L. Ruzzo
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1981
On truth-table reducibility to SAT and the difference hierarchy over NP
  • S. Buss, L. Hay
  • Mathematics, Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
A Taxonomy of Problems with Fast Parallel Algorithms
  • S. Cook
  • Mathematics, Computer Science
  • Inf. Control.
  • 1985
The complexity of optimization problems
  • M. Krentel
  • Mathematics, Computer Science
  • STOC '86
  • 1986
...
1
2
3
...