Searching for authors named "Richard Beigel" – sorted by Relevance.
74 documents found, showing 1 through 10.
Next 10 →
-
On The Relativized Power of Additional Accepting Paths
- …On The Relativized Power of Additional Accepting Paths Richard Beigel Department of Computer…
- Cited by 13 (2 self) – Add To MetaCart
-
NP-hard Sets are P-Superterse Unless R = NP
- …NP-hard Sets are P-Superterse Unless R = NP Richard Beigel Department of Computer Science…
- Cited by 26 (5 self) – Add To MetaCart
-
Closure Properties of GapP and P
- …Yale University Department of Computer Science Closure Properties of GapP and #P Richard Beigel…
- Cited by 1 (0 self) – Add To MetaCart
-
Bi-immunity Results for Cheatable Sets
- …Bi-immunity Results for Cheatable Sets Richard Beigel Department of Computer Science The Johns…
- Cited by 10 (6 self) – Add To MetaCart
-
Unbounded Searching Algorithms
- …Unbounded Searching Algorithms Richard Beigel Department of Computer Science The Johns Hopkins…
- Cited by 7 (2 self) – Add To MetaCart
-
When are k+1 Queries Better Than k?
- …When are k + 1 Queries Better Than k? Richard Beigel Department of Computer Science The Johns…
- Cited by 1 (0 self) – Add To MetaCart
-
The multiparty communication complexity of Exact-T: Improved bounds and new problems
- … The Multiparty Communication Complexity of Exact-T : Improved Bounds and New Problems Richard…
- Cited by 2 (1 self) – Add To MetaCart
-
Finding Maximum Independent Sets in Sparse and General Graphs
- … Richard Beigel University of Illinois at Chicago Closely related to the maximum clique problem…
- Cited by 36 (0 self) – Add To MetaCart
-
Bounded Queries to SAT and the Boolean Hierarchy
- …Bounded Queries to SAT and the Boolean Hierarchy Richard Beigel Department of Computer Science…
- Cited by 59 (12 self) – Add To MetaCart
-
Perceptrons, PP, And The Polynomial Hierarchy
- …PERCEPTRONS, PP, AND THE POLYNOMIAL HIERARCHY Richard Beigel Abstract. We construct a predicate…
- Cited by 2 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
