- Yale University Department of Computer Science
- Proof of Time Bounds for Recognizing Unambiguous and LR(k) Grammars Using
- INTERNATIONAL COMPUTER SCIENCE INSTITUTE 1947 Center Street ffl Suite 600 ffl Berkeley, California 94704 ffl 15106424274 ffl FAX 15106437684
- Length Bounded Molecular Computing \Lambda Bin Fu and Richard Beigel
- Finding Maximum Independent Sets in Sparse and General Graphs Richard Beigel \Lambda
- On the Query Complexity of Sets Richard Beigel ?1 , William Gasarch ??2 , Martin Kummer 3 , Georgia Martin 2 ,
- Circuits Over PP and PL \Lambda Richard Beigel y Bin Fu z
- Lower Bounds for Approximations by Low Degree Polynomials Over Zm Noga Alon
- A Relationship between Difference Hierarchies and Relativized Polynomial Hierarchies
- The Polynomial Method in Circuit Complexity Richard Beigel \Lambda
- A Comparison of ResourceBounded Molecular Computation Models \Lambda
- System Level Fault Diagnosis under Static, Dynamic, and Distributed
- Math C067 Independence and Repeated Trials. Richard Beigel
- Math C067 Binomial and Normal Distributions Richard Beigel
- Math C067 --Example Richard Beigel
- The Nobel Prize On October 16, 1990, the Royal Swedish Academy of Sciences announced
- Math C067 Practice Questions Richard Beigel
- Math C067 Sampling Distributions Sample Mean and Sample Proportion
- Math C067 Chapter 57 Review: Formulas and Methods print and bring to final exam
- Gaps in Bounded Query Hierarchies \Lambda Richard Beigel
- [6] Z. Galil. Optimal parallel algorithms for string matching. Proc. of the 16th Ann. ACM Symp. on Theory of Computing, 67:144--157, 1984.
- The Power of Local SelfReductions Richard Beigel \Lambda
- Solving Intractable Problems with DNA Computing \Lambda Richard Beigel and Bin Fu
- Sorting n Objects with a kSorter Richard Beigel \Lambda
- AlmostEverywhere Complexity Hierarchies for Nondeterministic Time \Lambda
- March 6, 1999 1 Exercise numbering
- Yale University Department of Computer Science
- Primitive Recursion without Implicit Predecessor \Lambda Michael J. Fischer y
- Circuit Lower Bounds Collapse Relativized Complexity Classes
- Locating Faults in a Constant Number of Parallel Testing Rounds (Preliminary Version)
- On The Relativized Power of Additional Accepting Paths Richard Beigel \Lambda
- Yale University Department of Computer Science
- Molecular Computing, Bounded Nondeterminism, and Efficient Recursion \Lambda
- PERCEPTRONS, PP, AND THE POLYNOMIAL HIERARCHY
- Approximable sets \Lambda Richard Beigel y
- Relativized Counting Classes: Relations among Thresholds, Parity, and Mods
- Downward separation fails catastrophically for limited nondeterminism classes
- WHEN DO EXTRA MAJORITY GATES HELP? POLYLOG(N) MAJORITY GATES
- When are k + 1 Queries Better Than k? Richard Beigel \Lambda
- Enumerations of the Kolmogorov Function Richard Beigel Harry Buhrman x Lance Fortnow { Luc Longpr e k
- The Expressive Power of Voting Polynomials James Aspnes \Lambday Richard Beigel \Lambdaz Merrick Furst x Steven Rudich x
- OC1: A randomized algorithm for building oblique decision trees
- On Molecular Approximation Algorithms for NP Optimization Problems \Lambda
- International Journal of Foundations of Computer Science World Scienti c Publishing Company
- Bounded Query Classes and the Difference Richard Beigel \Lambda
- 1 Gaps in Bounded Query Hierarchies 2 Richard Beigel
- Bounded Queries to SAT and the Boolean Richard Beigel \Lambda
- Incremental Data Structures and Algorithms for Dynamic Query Interfaces \Lambda
- Incoherence 17 [21] R. Lipton, New Directions in Testing, in Distributed Computing and
- 3Coloring in time O(1:3446 n ): a noMIS algorithm Richard Beigel \Lambda
- The Geometry of Browsing Richard Beigel 1 and Egemen Tanin 2
- Richard Beigel and Jun Tarui Abstract. We show that every language L in the class ACC can
- On Probabilistic ACC Circuits with an ExactThreshold Output Gate
- REPRESENTING BOOLEAN FUNCTIONS AS POLYNOMIALS MODULO
- Math C067 --Confidence Intervals Richard Beigel
- Math C067 --Practice Test Open Book, Open Notes, Open Teacher
- Math C067 --Practice Test Open Book, Open Notes, Open Teacher
- Commutative Queries (Extended Abstract)
- Quantifying the Amount of Verboseness \Lambda Richard Beigel y
- The Complexity of Modular Graph Automorphism
- Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds Richard Beigel \Lambda
- PP is Closed Under Intersection \Lambda Richard Beigel y
- O(2 n ) Volume Molecular Algorithm for Hamiltonian Path submitted to DNA '98
- Are Cook and Karp Ever the Same? Richard Beigel
- Volume Bounded Molecular Computation A Dissertation
- Fault Diagnosis in a Flash Richard Beigel \Lambda William Hurwood \Lambda Nabil Kahale y
- Unbounded Searching Algorithms Richard Beigel \Lambda
- Irrationality Without Number Theory Richard Beigel \Lambda
- 1 Commutative Queries 2 Richard Beigel
- Math C067 Bayes' Theorem Richard Beigel
- NPhard Sets are PSuperterse Unless R = NP Richard Beigel \Lambda
- The Mapmaker's Dilemma Richard Beigel \Lambda
- BIBLIOGRAPHY 61 [38] K. Siu, V. Roychowdhury, and T. Kailath. Computing with almost optimal size thresh
- NP Might Not Be As Easy As Detecting Unique Solutions Richard Beigel \Lambda
- Terse, Superterse, and Verbose Sets 1 2 Richard Beigel 3
- Math C067 Random Variables Richard Beigel
- Yale University Department of Computer Science
- Some Connections between Bounded Query Classes and NonUniform Complexity
- 1 Commutative Queries 2 Richard Beigel #
- Yale University Department of Computer Science
- QUERYLIMITED REDUCIBILITIES a dissertation
- The Perceptron Strikes Back \Lambda preliminary report
- Counting Classes: Thresholds, Parity, Mods, and Fewness \Lambda Richard Beigel y John Gill z
- Math C067 --Hypothesis Testing Richard Beigel
