The following pages link to Computational Complexity (Q172540):
Displaying 50 items.
- On being incoherent without being very hard (Q1198954) (← links)
- Polynomial-time compression (Q1198955) (← links)
- The quantifier structure of sentences that characterize nondeterministic time complexity (Q1198956) (← links)
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields (Q1198957) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- Improved low-density subset sum algorithms (Q1207335) (← links)
- A deterministic test for permutation polynomials (Q1207336) (← links)
- Counting connected components of a semialgebraic set in subexponential time (Q1207337) (← links)
- Majority gates vs. general weighted threshold gates (Q1210330) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- Addendum to: Non-deterministic exponential time has two-prower interactive protocols (Q1210334) (← links)
- Circuits and multi-party protocols (Q1266161) (← links)
- Complexity theoretic hardness results for query learning (Q1266164) (← links)
- Monadic logical definability of nondeterministic linear time (Q1266167) (← links)
- A lower bound on the MOD 6 degree of the OR function (Q1272657) (← links)
- Some bounds on multiparty communication complexity of pointer jumping (Q1272658) (← links)
- Verifying the determinant in parallel (Q1272660) (← links)
- Symmetric alternation captures BPP (Q1272661) (← links)
- Sperner's lemma and robust machines (Q1272662) (← links)
- On coherence, random-self-reducibility, and self-correction (Q1272663) (← links)
- An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095) (← links)
- A quantifier elimination for the theory of \(p\)-adic numbers (Q1277096) (← links)
- Probabilistic type-2 operators and ``almost''-classes (Q1277097) (← links)
- Lower bounds for the polynomial calculus (Q1293358) (← links)
- Improved depth lower bounds for small distance connectivity (Q1293359) (← links)
- Computing Boolean functions by polynomials and threshold circuits (Q1293360) (← links)
- Automaticity. III: Polynomial automaticity and context-free languages (Q1293361) (← links)
- Symmetric approximation arguments for monotone lower bounds without sunflowers (Q1300606) (← links)
- On randomized one-round communication complexity (Q1300607) (← links)
- Quantifying knowledge complexity (Q1300608) (← links)
- The alternation hierarchy for sublogarithmic space is infinite (Q1312177) (← links)
- The relative power of logspace and polynomial time reductions (Q1312179) (← links)
- Finding maximal orders in semisimple algebras over \(\mathbb{Q}\) (Q1312180) (← links)
- Shallow circuits and concise formulae for multiple addition and multiplication (Q1312182) (← links)
- The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183) (← links)
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- Primality testing with fewer random bits (Q1321031) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- Two tapes versus one for off-line Turing machines (Q1321033) (← links)
- \(\text{RL}\subseteq \text{SC}\) (Q1327590) (← links)
- A note on Rabin's width of a complete proof (Q1327592) (← links)
- An algorithm to learn read-once threshold formulas, and transformations between learning models (Q1327594) (← links)
- Invariance properties of RAMs and linear time (Q1327595) (← links)
- Finding irreducible components of some real transcendental varieties (Q1332661) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- Function-algebraic characterizations of log and polylog parallel time (Q1332666) (← links)
