Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization von Allender, Eric

Volltext

Cryptographic hardness under projections for time-bounded Kolmogorov complexity von Allender, Eric, Gouwar, John, Hirahara, Shuichi, Robelle, Caleb

Volltext

New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems von Allender, Eric, Hirahara, Shuichi

Volltext

Amplifying Lower Bounds by Means of Self-Reducibility von ALLENDER, Eric, KOUCKY, Michal

Volltext

The Non-hardness of Approximating Circuit Size von Allender, Eric, Ilango, Rahul, Vafa, Neekon

Volltext

Curiouser and Curiouser: The Link between Incompressibility and Complexity von Allender, Eric

Volltext

The Complexity of Complexity von Allender, Eric

Volltext

Zero knowledge and circuit minimization von Allender, Eric, Das, Bireswar

Volltext

The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory von Allender, Eric, Koucký, Michal, Ronneburger, Detlef, Roy, Sambuddha

Volltext

Limits on the computational power of random strings von Allender, Eric, Friedman, Luke, Gasarch, William

Volltext

Uniform constant-depth threshold circuits for division and iterated multiplication von Hesse, William, Allender, Eric, Mix Barrington, David A.

Volltext

Complexity of regular functions von Allender, Eric, Mertz, Ian

Volltext

Minimum Circuit Size, Graph Isomorphism, and Related Problems von Allender, Eric, Grochow, Joshua A., van Melkebeek, Dieter, Moore, Cristopher, Morgan, Andrew

Volltext

Complexity of finite-horizon Markov decision process problems von MUNDHENK, MARTIN, Goldsmith, Judy, LUSENA, CHRISTOPHER, ALLENDER, ERIC

Volltext

Reductions to the set of random strings: The resource-bounded case von Allender, Eric, Buhrman, Harry, Friedman, Luke, Loff, Bruno

Volltext

The New Complexity Landscape Around Circuit Minimization von Allender, Eric

Volltext

On the power of algebraic branching programs of width two von Allender, Eric, Wang, Fengming

Volltext

Depth-first search in directed planar graphs, revisited von Allender, Eric, Chauhan, Archit, Datta, Samir

Volltext

Planar and Grid Graph Reachability Problems von Allender, Eric, Mix Barrington, David A., Chakraborty, Tanmoy, Datta, Samir, Roy, Sambuddha

Volltext

Reductions to the Set of Random Strings: The Resource-Bounded Case von Allender, Eric, Buhrman, Harry, Friedman, Luke, Loff, Bruno

Volltext