BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Italy
2 × USA
Collaborated with:
S.Rudich T.Hirst B.Fu H.Buhrman L.Fortnow D.A.M.Barrington N.Reingold D.A.Spielman J.Aspnes M.L.Furst
Talks about:
help (3) polynomi (2) major (2) gate (2) one (2) nondetermin (1) molecular (1) intersect (1) function (1) composit (1)

Person: Richard Beigel

DBLP DBLP: Beigel:Richard

Contributed to:

STOC 19981998
ICALP 19971997
STOC 19921992
STOC 19911991

Wrote 7 papers:

STOC-1998-BeigelBF #detection
NP Might Not Be As Easy As Detecting Unique Solutions (RB, HB, LF), pp. 203–208.
STOC-1998-BeigelH
One Help Bit Doesn’t Help (RB, TH), pp. 124–130.
ICALP-1997-BeigelF #bound #nondeterminism #performance #recursion
Molecular Computing, Bounded Nondeterminism, and Efficient Recursion (RB, BF), pp. 816–826.
STOC-1992-BarringtonBR #representation
Representing Boolean Functions as Polynomials Modulo Composite Numbers (DAMB, RB, SR), pp. 455–461.
STOC-1992-Beigel
When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to One (RB), pp. 450–454.
STOC-1991-AspnesBFR #power of
The Expressive Power of Voting Polynomials (JA, RB, MLF, SR), pp. 402–409.
STOC-1991-BeigelRS
PP Is Closed Under Intersection (RB, NR, DAS), pp. 1–9.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.