58
Publications
3K
Citations
31
H-Index
1987
Active since
Richard Beigel is an author at Yale University specializing in engineering, computer science, and computational complexity.
Top concepts
EngineeringComputer ScienceComputational ComplexityDiscrete MathematicsCombinatorial OptimizationFormal MethodsAutomated ReasoningTheory Of ComputingComplexitySatisfiability
Publications per year
1987–2014
58
58
The polynomial method in circuit complexity
Richard Beigel · 2002 · 163 citations
Circuit Complexity, Computational Complexity Theory, Engineering +16
PP is closed under intersection
Richard Beigel, Nick Reingold, Daniel A. Spielman · 1991 · 160 citations
Richard Beigel, Jun Tarui · Computational Complexity · 1994 · 160 citations
The expressive power of voting polynomials
James Aspnes, Richard Beigel, Merrick L. Furst et al. · COMBINATORICA · 1994 · 159 citations
Richard Beigel, David Eppstein · Journal of Algorithms · 2004 · 155 citations · Full text
Rows per page
1–5 of 58