Pages that link to "Item:Q794427"

The following pages link to Some consequences of non-uniform conditions on uniform classes (Q794427):

Displayed 35 items.

• Lower bounds for kernelizations and other preprocessing procedures (Q538466) ‎ (← links)
• Infeasibility of instance compression and succinct PCPs for NP (Q619903) ‎ (← links)
• Improving known solutions is hard (Q687508) ‎ (← links)
• On small generators (Q802309) ‎ (← links)
• Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes (Q809600) ‎ (← links)
• \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) ‎ (← links)
• New developments in structural complexity theory (Q913509) ‎ (← links)
• On the complexity of ranking (Q920620) ‎ (← links)
• The Boolean hierarchy of NP-partitions (Q924719) ‎ (← links)
• The 1-versus-2 queries problem revisited (Q970102) ‎ (← links)
• On some natural complete operators (Q1064780) ‎ (← links)
• Graph isomorphism is in the low hierarchy (Q1116696) ‎ (← links)
• Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170) ‎ (← links)
• Logarithmic advice classes (Q1193903) ‎ (← links)
• On the power of two-local random reductions (Q1209364) ‎ (← links)
• On sparse hard sets for counting classes (Q1210293) ‎ (← links)
• On hiding information from an oracle (Q1263281) ‎ (← links)
• Probabilistic complexity classes and lowness (Q1263979) ‎ (← links)
• On compact representations of propositional circumscription (Q1391128) ‎ (← links)
• Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) ‎ (← links)
• Some connections between bounded query classes and non-uniform complexity. (Q1426008) ‎ (← links)
• Competing provers yield improved Karp-Lipton collapse results (Q1775885) ‎ (← links)
• Commutative queries (Q1854422) ‎ (← links)
• Bounded queries, approximations, and the Boolean hierarchy (Q1854449) ‎ (← links)
• Preprocessing of intractable problems (Q1854544) ‎ (← links)
• Nonuniform lowness and strong nonuniform lowness (Q1894328) ‎ (← links)
• Two queries (Q1961371) ‎ (← links)
• The size of a revised knowledge base (Q1978467) ‎ (← links)
• Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368) ‎ (← links)
• Data Reduction for Graph Coloring Problems (Q3088272) ‎ (← links)
• Parameterized Complexity of Eulerian Deletion Problems (Q3104771) ‎ (← links)
• On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) ‎ (← links)
• Two Edge Modification Problems without Polynomial Kernels (Q3656868) ‎ (← links)
• Monotonous and randomized reductions to sparse sets (Q4717050) ‎ (← links)
• The 1-Versus-2 Queries Problem Revisited (Q5387752) ‎ (← links)