The following pages link to Eric Allender (Q1058525):
Displaying 50 items.
- The Complexity of Complexity (Q2973719) (← links)
- Limits on the Computational Power of Random Strings (Q3012814) (← links)
- On the Power of Algebraic Branching Programs of Width Two (Q3012846) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- (Q3191604) (← links)
- (Q3224095) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
- (Q3355230) (← links)
- (Q3360127) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- Complexity of finite-horizon Markov decision process problems (Q3457753) (← links)
- P-uniform circuit complexity (Q3474881) (← links)
- Limitations of the upward separation technique (Q3490941) (← links)
- Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds (Q3503619) (← links)
- Measure on P: Robustness of the notion (Q3569004) (← links)
- Avoiding Simplicity Is Complex (Q3576185) (← links)
- Amplifying lower bounds by means of self-reducibility (Q3578198) (← links)
- Uniform Derandomization from Pathetic Lower Bounds (Q3588422) (← links)
- Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table (Q3614150) (← links)
- On the Complexity of Numerical Analysis (Q3642872) (← links)
- (Q3730021) (← links)
- (Q3747725) (← links)
- (Q3747726) (← links)
- Counting hierarchies: Polynomial time and constant depth circuits (Q3971277) (← links)
- (Q3972530) (← links)
- Relating Equivalence and Reducibility to Sparse Sets (Q4016912) (← links)
- (Q4228466) (← links)
- (Q4240333) (← links)
- (Q4258574) (← links)
- (Q4266552) (← links)
- The permanent requires large uniform threshold circuits (Q4267800) (← links)
- A first-order isomorphism theorem (Q4281518) (← links)
- (Q4287355) (← links)
- Lower bounds for the low hierarchy (Q4302826) (← links)
- A Uniform Circuit Lower Bound for the Permanent (Q4312420) (← links)
- A First-Order Isomorphism Theorem (Q4337654) (← links)
- (Q4474202) (← links)
- (Q4501524) (← links)
- (Q4527042) (← links)
- (Q4668729) (← links)
- (Q4699290) (← links)
- P-Printable Sets (Q4732106) (← links)
- (Q4790379) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- NL-printable sets and Nondeterministic Kolmogorov Complexity (Q4924524) (← links)
- (Q4938621) (← links)
- Making Nondeterminism Unambiguous (Q4943859) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283) (← links)
- Better complexity bounds for cost register automata (Q5111238) (← links)
- New insights on the (non-)hardness of circuit minimization and related problems (Q5111269) (← links)
