The following pages link to Eric Allender (Q1058525):
Displaying 23 items.
- New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems (Q5205823) (← links)
- Depth reduction for noncommutative arithmetic circuits (Q5248521) (← links)
- STACS 2004 (Q5309733) (← links)
- Kolmogorov complexity, circuits, and the strength of formal theories of arithmetic (Q5414624) (← links)
- Reachability Problems: An Update (Q5426862) (← links)
- (Q5465356) (← links)
- Power from Random Strings (Q5470741) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492848) (← links)
- (Q5497123) (← links)
- (Q5875468) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897773) (← links)
- The non-hardness of approximating circuit size (Q5918358) (← links)
- The non-hardness of approximating circuit size (Q5919681) (← links)
- A lower bound for primality (Q5943093) (← links)
- Reducing the complexity of reductions (Q5957724) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Depth-First Search in Directed Planar Graphs, Revisited (Q6168415) (← links)
- (Q6187019) (← links)
- (Q6187822) (← links)
- StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) (Q6487439) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
- Kolmogorov complexity characterizes statistical zero knowledge (Q6610263) (← links)
- Robustness for space-bounded statistical zero knowledge (Q6663076) (← links)