R
Richard Beigel
Researcher at Temple University
Publications - 139
Citations - 4626
Richard Beigel is an academic researcher from Temple University. The author has contributed to research in topics: Upper and lower bounds & Turing machine. The author has an hindex of 37, co-authored 139 publications receiving 4533 citations. Previous affiliations of Richard Beigel include University of Illinois at Chicago & Johns Hopkins University.
Papers
More filters
Proceedings ArticleDOI
PP is closed under intersection
TL;DR: It is shown that PP is closed under a variety of polynomial-time truth-table reductions and in complexity theory include the definite collapse and (assuming P ? PP) separation of certain query hierarchies over PP.
Proceedings ArticleDOI
The polynomial method in circuit complexity
TL;DR: The basic techniques for using polynomials in complexity theory are examined, emphasizing intuition at the expense of formality and closure properties, upper bounds, and lower bounds obtained.
Journal ArticleDOI
On ACC
Richard Beigel,Jun Tarui +1 more
TL;DR: It is shown that every languageL in the class ACC can be recognized by depth-two deterministic circuits with a symmetric-function gate at the root and polynomialspn overZ of degree logO(1)n and with coefficients of magnitude.
Journal ArticleDOI
The expressive power of voting polynomials
TL;DR: The first correct proof that, for a random oracleA, PPA is properly contained in PSPACEA is given, which allows the new result that an AC0 circuit with one majority gate cannot approximate parity to be proved.
Proceedings Article
OC1: randomized induction of oblique decision trees
TL;DR: A new method that combines deterministic and randomized procedures to search for a good tree is explored, and the accuracy of the trees found with the method matches or exceeds the best results of other machine learning methods.