The following pages link to (Q4039803):
Displaying 50 items.
- A characterization of the leaf language classes (Q287160) (← links)
- Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
- The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\) (Q391177) (← links)
- On Goles' universal machines: a computational point of view (Q393156) (← links)
- Book review of: S. Arora and B. Barak, Computational complexity: a modern approach. (Q465661) (← links)
- Proof systems that take advice (Q553297) (← links)
- The isomorphism conjecture for constant depth reductions (Q619896) (← links)
- On the computational complexity of behavioral description-based web service composition (Q650907) (← links)
- Succinct circuit representations and leaf language classes are basically the same concept (Q671606) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Some results on selectivity and self-reducibility (Q672402) (← links)
- A note on Mod and generalised Mod classes (Q672491) (← links)
- Modulo classes and logarithmic advice (Q672652) (← links)
- If NP has polynomial-size circuits, then MA=AM (Q674343) (← links)
- Helping by unambiguous computation and probabilistic computation (Q675865) (← links)
- A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
- If not empty, NP-P is topologically large (Q688157) (← links)
- Comparing nontriviality for E and EXP (Q693048) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- Représentations des nombres réels par développements en base entière et complexité. (Representations of real numbers by expansions on integer basis and complexity) (Q804571) (← links)
- An upward measure separation theorem (Q808696) (← links)
- Multi-modal diagnosis combining case-based and model-based reasoning: a formal and experimental analysis (Q814620) (← links)
- Downward translations of equality (Q914368) (← links)
- Relations between average-case and worst-case complexity (Q927398) (← links)
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (Q948913) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Universal relations and {\#}P-completeness (Q954984) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- Structural properties of oracle classes (Q990941) (← links)
- Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170) (← links)
- Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
- On random oracle separations (Q1182108) (← links)
- On p-creative sets and p-completely creative sets (Q1183565) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- A survey of space complexity (Q1193412) (← links)
- On polynomial-time Turing and many-one completeness in PSPACE (Q1193869) (← links)
- A note on two-way probabilistic automata (Q1195495) (← links)
- Strong separations of the polynomial hierarchy with oracles: Constructive separations by immune and simple sets (Q1199689) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- Deciding bisimilarity is P-complete (Q1203120) (← links)
- On the computational complexity of integral equations (Q1207544) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- On 1-truth-table-hard languages (Q1261477) (← links)
- A positive relativization of polynomial time versus polylog space (Q1261484) (← links)
- A note on sparse sets and the polynomial-time hierarchy (Q1263964) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
- The alternation hierarchy for sublogarithmic space is infinite (Q1312177) (← links)
