The following pages link to Computational Complexity (Q172540):
Displaying 50 items.
- On the complexity of computing the diameter of a polytope (Q1337144) (← links)
- A theory of strict P-completeness (Q1337145) (← links)
- On closure properties of GapP (Q1337146) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- On the degree of Boolean functions as real polynomials (Q1346612) (← links)
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
- Complex polynomials and circuit lower bounds for modular counting (Q1346614) (← links)
- Perceptrons, PP, and the polynomial hierarchy (Q1346615) (← links)
- On ACC (Q1346616) (← links)
- Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
- Circuits constructed with MOD\(_ q\) gates cannot compute ``and'' in sublinear size (Q1346618) (← links)
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- An average complexity measure that yields tight hierarchies (Q1355380) (← links)
- Simple learning algorithms using divide and conquer (Q1355381) (← links)
- Representations of sets of Boolean functions by commutative rings (Q1377570) (← links)
- Tribute to Roman Smolensky (1960--1995) (Q1377571) (← links)
- Easy lower bound for a strange computational model (Q1377572) (← links)
- Reflections on ``Representations of sets of Boolean functions by commutative rings'' by Roman Smolensky (Q1377573) (← links)
- Lower bounds on arithmetic circuits via partial derivatives (Q1377574) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Lower bounds for polynomial evaluation and interpolation problems (Q1386175) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- Collecting coupons on trees, and the cover time of random walks (Q1386177) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- Well-known bound for the VC-dimension made easy (Q1386180) (← links)
- Optimality of size-width tradeoffs for resolution (Q1405735) (← links)
- A characterization of span program size and improved lower bounds for monotone span programs (Q1405737) (← links)
- Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds (Q1405738) (← links)
- Errata for: ``On randomized one-round communication complexity'' (Q1405739) (← links)
- On interactive proofs with a laconic prover (Q1413647) (← links)
- The complexity of tensor calculus (Q1413648) (← links)
- Homogenization and the polynomial calculus (Q1430569) (← links)
- Hard examples for the bounded depth Frege proof system (Q1430570) (← links)
- Separability and one-way functions (Q1430571) (← links)
- On the hardness of approximating the permanent of structured matrices (Q1430572) (← links)
- On lower bounds for the complexity of polynomials and their multiples (Q1587343) (← links)
- Complexity lower bounds for randomized computation trees over zero characteristic fields (Q1587344) (← links)
- Interactive protocols over the reals (Q1587345) (← links)
- Function algebraic characterizations of the polytime functions (Q1587346) (← links)
- On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs (Q1587348) (← links)
- Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape (Q1587349) (← links)
- Lower bounds for the multiplicative complexity of matrix multiplication (Q1590075) (← links)
- Solvability of systems of polynomial congruences modulo a large prime (Q1590076) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q1590077) (← links)
- On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games (Q1590078) (← links)
- Exponential lower bounds for depth three Boolean circuits (Q1590079) (← links)
- A complex-number Fourier technique for lower bounds on the mod-\(m\) degree (Q1590080) (← links)
- The average sensitivity of square-freeness (Q1590081) (← links)
