23
Publications
1.8K
Citations
17
H-Index
1956
Active since
Robert Beals is an author at University of Chicago specializing in engineering, computational complexity, and computer science.
Top concepts
EngineeringComputational ComplexityComputer ScienceDiscrete MathematicsEducationLinear GroupsCircuit ComplexityRepresentation TheoryQuantum ScienceQuantum Computing
Publications per year
1956–2013
23
23
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve et al. · Journal of the ACM · 2001 · 624 citations
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve et al. · 2002 · 180 citations
Quantum Lower Bounds by Polynomials
Robert Beals, Harry Buhrman, Richard Cleve et al. · ArXiv.org · 1998 · 179 citations · Full text
Circuit Complexity, Quantum Science, T Black-box Queries +13
Quantum computation of Fourier transforms over symmetric groups
Robert Beals · 1997 · 148 citations · Full text
Rows per page
1–5 of 23