Relativizing Small Complexity Classes and their Theories
Klaus Aehlig, Stephen Cook, Phuong Nguyen

TL;DR
This paper introduces new definitions for relativized small complexity classes that preserve known class inclusions, explores their hierarchies and collapses, and develops theories characterizing these relativized classes.
Contribution
It provides the first definitions of relativizations that maintain class inclusions, analyzes their hierarchies, and develops theories for relativized subclasses of P.
Findings
Relativizations preserving class inclusions are introduced.
Collapse of any two classes implies the collapse of their relativizations.
An oracle is constructed to separate relativized classes hierarchically.
Abstract
Existing definitions of the relativizations of \NCOne, \L\ and \NL\ do not preserve the inclusions , . We start by giving the first definitions that preserve them. Here for \L\ and \NL\ we define their relativizations using Wilson's stack oracle model, but limit the height of the stack to a constant (instead of ). We show that the collapse of any two classes in implies the collapse of their relativizations. Next we exhibit an oracle that makes a proper hierarchy. This strengthens and clarifies the separations of the relativized theories in [Takeuti, 1995]. The idea is that a circuit whose nested depth of oracle gates is bounded by cannot compute correctly the compositions of every oracle function. Finally we develop theories that characterize the relativizations of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Machine Learning and Algorithms · Optimization and Search Problems
