Richard Beigel

From MaRDI portal
Person:294935

Available identifiers

zbMath Open beigel.richardMaRDI QIDQ294935

List of research outcomes

PublicationDate of PublicationType
Sorting n objects with a k-sorter2018-09-14Paper
Molecular computing, bounded nondeterminism, and efficient recursion2018-07-04Paper
On the sizes of DPDAs, PDAs, LBAs2016-06-16Paper
A NOTE ON THE POLYNOMIAL REPRESENTATION OF BOOLEAN FUNCTIONS OVER GF(2)2015-04-29Paper
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing2012-07-16Paper
Algorithms and Computation2009-08-07Paper
Square-Difference-Free Sets of Size Omega(n^{0.7334...})2008-04-30Paper
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems2007-09-05Paper
Infinitely‐Often Autoreducible Sets2007-06-26Paper
A tight lower bound for restricted PIR protocols2006-09-28Paper
Enumerations of the Kolmogorov function2006-08-03Paper
Algorithms and Computation2005-12-22Paper
3-coloring in time2005-02-22Paper
Learning a Hidden Matching2005-02-21Paper
Algorithms for four variants of the exact satisfiability problem2004-08-10Paper
Some connections between bounded query classes and non-uniform complexity.2004-03-14Paper
Commutative queries2003-01-14Paper
Optimal series-parallel trade-offs for reducing a function to its own graph2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q45425292002-08-01Paper
https://portal.mardi4nfdi.de/entity/Q45425382002-08-01Paper
https://portal.mardi4nfdi.de/entity/Q27578462001-12-04Paper
The Complexity of Modular Graph Automorphism2001-03-19Paper
Circuits over PP and PL2001-03-12Paper
The complexity of ODDnA2000-06-22Paper
https://portal.mardi4nfdi.de/entity/Q42527422000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42527292000-04-26Paper
A comparison of resource-bounded molecular computation models2000-04-25Paper
https://portal.mardi4nfdi.de/entity/Q42636881999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42585811999-09-13Paper
https://portal.mardi4nfdi.de/entity/Q42523761999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42467331999-06-15Paper
Molecular computing, bounded nondeterminism, and efficient recursion1999-01-01Paper
Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis1998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q43813871998-07-16Paper
Upper and lower bounds for some depth-3 circuit classes1998-07-06Paper
https://portal.mardi4nfdi.de/entity/Q43758061998-05-10Paper
https://portal.mardi4nfdi.de/entity/Q31289331997-04-23Paper
Frequency computation and bounded queries1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q47155071996-11-17Paper
Approximable sets1996-04-16Paper
PP is closed under intersection1995-06-08Paper
Quantifying the amount of verboseness1995-05-28Paper
When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one1995-04-06Paper
Perceptrons, PP, and the polynomial hierarchy1995-04-06Paper
On ACC1995-04-06Paper
Representing Boolean functions as polynomials modulo composite numbers1995-04-06Paper
The expressive power of voting polynomials1994-08-11Paper
Almost-everywhere complexity hierarchies for nondeterministic time1993-09-16Paper
A relationship between difference hierarchies and relativized polynomial hierarchies1993-08-22Paper
Terse, superterse, and verbose sets1993-06-29Paper
On being incoherent without being very hard1993-01-16Paper
Counting classes: Thresholds, parity, mods, and fewness1993-01-16Paper
The Mapmaker's dilemma1992-06-28Paper
Irrationality Without Number Theory1992-06-27Paper
Bounded queries to SAT and the Boolean hierarchy1992-06-26Paper
Probabilistic polynomial time is closed under parity reductions1991-01-01Paper
Relativized counting classes: Relations among thresholds, parity, and mods1991-01-01Paper
Bi-immunity results for cheatable sets1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552301990-01-01Paper
Unbounded Searching Algorithms1990-01-01Paper
Counting classes: Thresholds, parity, mods, and fewness1990-01-01Paper
On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case1989-01-01Paper
Bounded query classes and the difference hierarchy1989-01-01Paper
Nondeterministic bounded query reducibilities1989-01-01Paper
On the complexity of finding the chromatic number of a recursive graph. I: The bounded case1989-01-01Paper
Rearranging Terms in Alternating Series1981-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Richard Beigel