The following pages link to Eric W. Allender (Q1058525):
Displaying 50 items.
- (Q202097) (redirect page) (← links)
- On the power of algebraic branching programs of width two (Q260398) (← links)
- Comments on ``Arithmetic complexity, Kleene closure, and formal power series'' (Q372962) (← links)
- Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication'' (Q386053) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Avoiding simplicity is complex (Q693072) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- The new complexity landscape around circuit minimization (Q782552) (← links)
- Kolmogorov complexity and degrees of tally sets (Q916650) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- On the number of cycles possible in digraphs with large girth (Q1058526) (← links)
- Improved lower bounds for the cycle detection problem (Q1058851) (← links)
- Isomorphisms and 1-L reductions (Q1107310) (← links)
- Rudimentary reductions revisited (Q1183444) (← links)
- Almost-everywhere complexity hierarchies for nondeterministic time (Q1261465) (← links)
- RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\) (Q1271273) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- Depth reduction for circuits of unbounded fan-in (Q1333269) (← links)
- Arithmetic complexity, Kleene closure, and formal power series (Q1405781) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Some consequences of the existnce of pseudorandom generators (Q1822961) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- Complexity of some arithmetic problems for binary polynomials (Q1889852) (← links)
- Limits on the computational power of random strings (Q1951574) (← links)
- The complexity of matrix rank and feasible systems of linear equations (Q1961056) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Better complexity bounds for cost register automata (Q1999991) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- Dual VP classes (Q2410687) (← links)
- Complexity of regular functions (Q2424670) (← links)
- What can be efficiently reduced to the Kolmogorov-random strings? (Q2576937) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- (Q2709238) (← links)
- (Q2743685) (← links)
- (Q2776267) (← links)
- Complexity of Regular Functions (Q2799196) (← links)
- Investigations Concerning the Structure of Complete Sets (Q2821693) (← links)
- Reductions to the set of random strings: The resource-bounded case (Q2878751) (← links)
- Curiouser and Curiouser: The Link between Incompressibility and Complexity (Q2904388) (← links)
- Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs (Q2922591) (← links)
- Zero Knowledge and Circuit Minimization (Q2922592) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- Dual VP Classes (Q2946373) (← links)
- The Minimum Oracle Circuit Size Problem. (Q2954981) (← links)
