Tag: oracles

Found 48 results for 'oracles'.

1) cc.complexity-theory - Relativization with Respect to Non-Recursive Oracles
2) cc.complexity-theory - What is known about NP hard problems that access preprocessed information?
3) cc.complexity-theory - Is there an oracle such that SAT is not infinitely often in sub-exponential time?
4) ds.algorithms - Young Diagrams and distinguishing between two distributions
5) quantum-computing - Quantum oracle implementation overhead
6) cc.complexity-theory - What is the minimum complexity oracle that separates PSPACE from the polynomial hierarchy?
7) cc.complexity-theory - Worlds Relative to Which "Invulnerable Generators" Do Not Exist
8) cc.complexity-theory - Relativized world where ${\bf P^A}={\bf NP^A}\not = {\bf PP^A}$
9) cc.complexity-theory - What is $DTIME(n^a)^{DTIME(n^b)}$?
10) cc.complexity-theory - P with integer factorization oracle
11) cc.complexity-theory - Dominations under oracles which is closed under complement?
12) cc.complexity-theory - Is relativization well-defined?
13) reductions - Why is the "general notion of a reduction [...] inherent to the notion of self-reducibility"?
14) cc.complexity-theory - Is it possible to reduce an NP language to a NEXP language with exponentially smaller input length?
15) cc.complexity-theory - Circuits with oracles vs. Turing Machines with oracles
16) oracles - Recursive generic oracles
17) cc.complexity-theory - Can an oracle allowing errors be non-relativizing?
18) lo.logic - Is there a good notion of non-termination and halting proofs in type theory?
19) cc.complexity-theory - Is $PP^{(PP^A)} = PP^A$ ?
20) cc.complexity-theory - Exhausting Simulator of Zero-Knowledge Protocols in the Random Oracle Model
21) cc.complexity-theory - Complexity theory when an oracle is part of the input
22) cc.complexity-theory - Does there exist an oracle $A$ such that $(P^{\#P})^{A} \neq PSPACE^{A}$?
23) cc.complexity-theory - Oracle relative to which BPP = EXP
24) cc.complexity-theory - Ruzzo-Simon-Tompa oracle access mechanism
25) cc.complexity-theory - Is $coNP^{\#P}=NP^{\#P}=P^{\#P}$?
26) cc.complexity-theory - Oracle comparing $EXP$ with $UP$
27) cc.complexity-theory - Is there an oracle that separates two complexity classes known to be equal?
28) cc.complexity-theory - Baker Gill Solovay $P^B \ne NP^B$ relativization, what class is $B$ in?
29) linear-programming - Is there a simplex-like algorithm that can be used with a separation oracle?
30) oracles - Is there a definitive reference for Turing machines with multiple oracle tapes?
31) cc.complexity-theory - Is $P^{\#P}=(P^{\#P})^{\#P}$ ?
32) cc.complexity-theory - space-bounded TMs and oracles
33) computability - For a random oracle R, does BPP equal the set of computable languages in P^R?
34) cc.complexity-theory - Lower bounds for nonuniform circuits and oracles separating complexity classes
35) complexity-classes - What are examples of complexity classes that have contradictory relativizations but they were proven to be either equal or unequal?
36) complexity-classes - Is $\sf{P^{NP \cap coNP}} = \sf{NP \cap coNP}$?
37) oracles - Oracle-Decidability of Algebraic Independence
38) oracles - It is known that $L \subsetneq PH$?
39) cc.complexity-theory - Is $coNP^{\#P}=NP^{\#P}=P^{\#P}$?
40) cc.complexity-theory - Are there canonical non-relativizing techniques?
41) cc.complexity-theory - Oracle relative to which $\mathsf{BPP}$ is not contained in $Δ_2 \mathsf{P}$
42) cc.complexity-theory - Is $\mathsf{MA}$ equal to $\mathsf{NP}^\mathsf{RP}$?
43) computability - Is predicting (in the limit) computable sequences as hard as a dominating function?
44) quantum-computing - Oracle Construction for Grover's Algorithm
45) cc.complexity-theory - Is $UP\not=NP$ with respect to random oracle?
46) cc.complexity-theory - Complexity class separation in the presence of relativization barriers
47) cc.complexity-theory - Is $P^{\#P}=(P^{\#P})^{\#P}$ ?
48) cc.complexity-theory - Oracle relative to which $\mathsf{BPP}$ is not contained in $Δ_2 \mathsf{P}$