Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
On the sizes of DPDAs, PDAs, LBAsBeigel, Richard ; Gasarch, WilliamTheoretical computer science, 2016-07, Vol.638, p.63-75 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
A tight lower bound for restricted pir protocolsBeigel, Richard ; Fortnow, Lance ; Gasarch, WilliamComputational complexity, 2006-05, Vol.15 (1), p.82-91 [Periódico revisado por pares]Heidelberg: Springer Nature B.VTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
3-coloring in time O ( 1.3289 n )Beigel, Richard ; Eppstein, DavidJournal of algorithms, 2005-02, Vol.54 (2), p.168-204 [Periódico revisado por pares]San Diego, CA: Elsevier IncTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Learning a hidden matchingALON, Noga ; BEIGEL, Richard ; KASIF, Simon ; RUDICH, Steven ; SUDAKOV, BennySIAM journal on computing, 2004, Vol.33 (2), p.487-501 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Algorithms for four variants of the exact satisfiability problemDahllöf, Vilhelm ; Jonsson, Peter ; Beigel, RichardTheoretical computer science, 2004-06, Vol.320 (2), p.373-394 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Bounded queries to SAT and the Boolean hierarchyBeigel, RichardTheoretical computer science, 1991-07, Vol.84 (2), p.199-223 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Infinitely‐Often Autoreducible SetsBeigel, Richard ; Fortnow, Lance ; Stephan, FrankSIAM journal on computing, 2006-01, Vol.36 (3), p.595-608 [Periódico revisado por pares]Philadelphia: Society for Industrial and Applied MathematicsTexto completo disponível |
8 |
Material Type: Ata de Congresso
|
![]() |
The geometry of browsingBEIGEL, R ; TANIN, ELecture notes in computer science, 1998, p.331-340 [Periódico revisado por pares]New York NY: Springer-VerlagTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
PP Is Closed under IntersectionBeigel, R. ; Reingold, N. ; Spielman, D.Journal of computer and system sciences, 1995-04, Vol.50 (2), p.191-202 [Periódico revisado por pares]Brugge: Elsevier IncTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Almost-everywhere complexity hierarchies for nondeterministic timeAllender, Eric ; Beigel, Richard ; Hertrampf, Ulrich ; Homer, StevenTheoretical computer science, 1993-07, Vol.115 (2), p.225-241 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |