The following pages link to Computational Complexity (Q172540):
Displaying 50 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- Quantum commitments from complexity assumptions (Q260394) (← links)
- The complexity of estimating min-entropy (Q260395) (← links)
- Relativizing small complexity classes and their theories (Q260396) (← links)
- On the power of algebraic branching programs of width two (Q260398) (← links)
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- Special issue ``Computational complexity conference 2015'' guest editors' foreword (Q301517) (← links)
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity (Q301519) (← links)
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Lower bounds for depth-three arithmetic circuits with small bottom fanin (Q301527) (← links)
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Factors of low individual degree polynomials (Q301529) (← links)
- Special issue on the 10th theory of cryptography conference: editor's foreword (Q332264) (← links)
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- Connect four and graph decomposition (Q347118) (← links)
- Collapse of the hierarchy of constant-depth exact quantum circuits (Q347120) (← links)
- A thirty year old conjecture about promise problems (Q347124) (← links)
- Affine extractors over large fields with exponential error (Q347127) (← links)
- On sunflowers and matrix multiplication (Q354642) (← links)
- Amplifying circuit lower bounds against polynomial time, with applications (Q354644) (← links)
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Is Valiant-Vazirani's isolation probability improvable? (Q354652) (← links)
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- Parallel approximation of min-max problems (Q354658) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- Improved approximation of linear threshold functions (Q371200) (← links)
- Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (Q395606) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Space functions and space complexity of the word problem in semigroups. (Q395608) (← links)
- Special issue: RANDOM'09. Selected papers based on the presentations at the 13th RANDOM conference, Berkeley, CA, USA, August 2009. (Q409080) (← links)
- Special issue: Computational complexity 2011. Selected papers based on the presentations at the 26th annual IEEE conference (CCC 2011), San Jose, CA, USA, June 8--10, 2011 (Q430163) (← links)
- More on average case vs approximation complexity (Q430823) (← links)
- Obituary: Misha Alekhnovich (Q430826) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Lower bounds for \(k\)-DNF resolution on random 3-CNFs (Q430840) (← links)
- Random low-degree polynomials are hard to approximate (Q430841) (← links)
- Hierarchy theorems for property testing (Q430844) (← links)
