The following pages link to Computational Complexity (Q172540):
Displaying 50 items.
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- Improving known solutions is hard (Q687508) (← links)
- Relativized isomorphisms of NP-complete sets (Q687510) (← links)
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- \textsc{ReachFewL} = \textsc{ReachUL} (Q744612) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- Correction to: ``Communication complexity with small advantage'' (Q777910) (← links)
- Toward better depth lower bounds: two results on the multiplexor relation (Q777911) (← links)
- Two-closures of supersolvable permutation groups in polynomial time (Q777912) (← links)
- Derandomizing Arthur-Merlin games using hitting sets (Q813315) (← links)
- Compression of samplable sources (Q813316) (← links)
- Language compression and pseudorandom generators (Q813317) (← links)
- The complexity of the covering radius problem (Q814418) (← links)
- Quantum Arthur-Merlin games (Q814420) (← links)
- Parameterized complexity of constraint satisfaction problems (Q814421) (← links)
- On the complexity of approximating TSP with neighborhoods and related problems (Q853644) (← links)
- The complexity of chromatic strength and chromatic edge strength (Q853645) (← links)
- Languages to diagonalize against advice classes (Q853646) (← links)
- On the computational power of Boolean decision lists (Q853647) (← links)
- The complexity of semilinear problems in succinct representation (Q862341) (← links)
- Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities (Q862342) (← links)
- Polynomial multiplication over finite fields: from quadratic to straight-line complexity (Q862343) (← links)
- Lower bounds for linear locally decodable codes and private information retrieval (Q862344) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- On the complexity of inverting integer and polynomial matrices (Q901933) (← links)
- Query complexity in errorless hardness amplification (Q901934) (← links)
- On rigid matrices and \(U\)-polynomials (Q901935) (← links)
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\) (Q937192) (← links)
- Randomness-efficient sampling within NC\(^{1}\) (Q937194) (← links)
- Space complexity vs. query complexity (Q937195) (← links)
- Inverse NP problems (Q937196) (← links)
- Hardness hypotheses, derandomization, and circuit complexity (Q937197) (← links)
- Halfspace matrices (Q937198) (← links)
- Exposure-resilient extractors and the derandomization of probabilistic sublinear time (Q937199) (← links)
- Time-space tradeoffs for counting NP solutions modulo integers (Q937201) (← links)
- Basis collapse in holographic algorithms (Q937202) (← links)
- Perfect parallel repetition theorem for quantum XOR proof systems (Q937205) (← links)
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms (Q937206) (← links)
- Special issue: Selected papers based on the presentations at the 10th RANDOM workshop, Barcelona, Spain, August 28--31, 2006. (Q946903) (← links)
- Special issue: Conference on computational complexity 2007. Selected papers based on the presentations at the 22nd annual IEEE computational complexity conference (CCC 2007), San Diego, CA, USA, June 13--16, 2007 (Q946917) (← links)
- Polynomials that sign represent parity and Descartes' rule of signs (Q1024658) (← links)
- The strength of multilinear proofs (Q1024659) (← links)
- On the complexity of succinct zero-sum games (Q1024660) (← links)
