We show that if a complexity classC is closed downward under polynomial-time majority truth-table reductions (≤ mtt p ), then practically every other.
Jun 14, 1993 · Then we show that all “reasonable” closure properties of a class C meeting our conditions are inherited by its bounded two-sided analogue BP[C].
We show that if a complexity class C is closed downward under polynomialtime majority truth-table reductions ( p ), then practically every other mtt \polynomial ...
On closure properties of bounded two-sided error complexity classes. K. W. Regan; J. S. Royer. OriginalPaper Pages: 229 - 243. Communication complexity of ...
This paper investigates closure properties of the classes of sets recognized by spacebounded two-dimensional probabilistic Turing machines with error ...
We also consider quantum analogues of nondeterministic and one-sided error probabilistic space- bounded classes, and prove some simple facts regarding these ...
Abstract. In this paper we study the properties of systems of bounded arithmetic capturing small complexity classes and state conditions suf-.
BPP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability bounded by 1/3 for all instances.
We focus on probabilistic polynomial-time machines with one-sided, two-sided and zero error probability (defining the classes RP (and coRP), BPP and ZPP).
Jun 13, 2018 · I know that RE has been proven not to be closed under complement, but I don't know of any examples from complexity theory rather than ...
Missing: Error | Show results with:Error