Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Book, Ronald"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On type-2 probabilistic quantifiers
Ronald V. Book
,
Heribert Vollmer
,
Klaus W. Wagner
Lecture Notes in Computer Science
1099
, 1996, pp. 369-380
On random hard sets for NP
Ronald V. Book
,
Osamu Watanabe
Information and Computation
125
(1), 1996, pp. 70-76
The global power of additional queries to random oracles
Ronald V. Book
,
Jack H. Lutz
,
David M., Jr. Martin
Information and Computation
120
(1), 1995, pp. 49-54
The global power of additional queries to random oracles
Ronald V. Book
,
Jack H. Lutz
,
David M., Jr. Martin
Lecture Notes in Computer Science
775
, 1994, pp. 403-414
An observation on probability versus randomness with applications to complexity classes
Ronald V. Book
,
Jack H. Lutz
,
Klaus W. Wagner
Math. Systems Theory
27
(3), 1994, pp. 201-209
On random hard sets for
NP
Ronald V. Book
,
Osamu Watanabe
Lecture Notes in Computer Science
834
, 1994, pp. 47-55
On collapsing the polynomial-time hierarchy
Ronald V. Book
Information Processing Letters
52
, 1994, pp. 235-237
Relativizations of the
P=?NP
and other problems: Developments in Structural Complexity Theory
Ronald V. Book
SIAM Review
36
(2), 1994, June, pp. 157-175
On languages reducible to algorithmically random languages
Ronald V. Book
SIAM Journal on Computing
23
(6), 1994, pp. 1275-1282
On languages with very high space-bounded Kolmogorov complexity
Ronald V. Book
,
Jack H. Lutz
SIAM Journal on Computing
22
(2), 1993, April, pp. 395-402
Relativizing complexity classes with random oracles
Ronald V. Book
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 250-258
On complexity classes and algorithmically random languages
Ronald V. Book
,
Jack H. Lutz
,
Klaus W. Wagner
Lecture Notes in Computer Science
577
, 1992, pp. 319-328
On languages with very high information content
Ronald V. Book
,
Jack H. Lutz
Proceedings of the 7th Annual Conference on Structure in Complexity Theory, CSCT'92 (Boston University, Boston, Massachusetts, June 22-25, 1992)
, 1992, pp. 255-259
On sets with small information content
Ronald V. Book
EATCS Monographs on Theoretical Computer Science
, 1992, pp. 23-42
Relativizations of the
P=?NP
and other problems: Some developments in structural complexity theory
Ronald V. Book
Lecture Notes in Computer Science
650
, 1992, pp. 175-186
Some observations on separating complexity classes
Ronald V. Book
SIAM Journal on Computing
20
(2), 1991, April, pp. 246-258
On random oracle separations
Ronald V. Book
Information Processing Letters
39
, 1991, pp. 7-10
On ``inherently context-sensitive'' languages - An application of complexity cores
Volker Diekert
,
Ronald V. Book
Information Processing Letters
40
, 1991, pp. 21-23
Polynomial-time reducibilities and ``almost all'' oracle sets
Shouwen Tang
,
Ronald V. Book
Theoretical Computer Science
81
, 1991, pp. 35-47
Additional queries to random and pseudorandom oracles
Ronald V. Book
,
Jack H. Lutz
,
Shouwen Tang
Lecture Notes in Computer Science
443
, 1990, pp. 283-293
Characterizing polynomial complexity classes by reducibilities
Ronald V. Book
,
Shouwen Tang
Math. Systems Theory
23
, 1990, pp. 165-174
A note on sparse sets and the polynomial-time hierarchy
Ronald V. Book
,
Shouwen Tang
Information Processing Letters
33
, 1989/90, pp. 141-143
On inefficient special cases of
NP
-complete problems
Ding-Zhu Du
,
Ronald V. Book
Theoretical Computer Science
63
, 1989, pp. 239-252
The structure of generalized complexity cores
Ronald V. Book
,
Ding-Zhu Du
Theoretical Computer Science
61
, 1988, pp. 103-119
On sets truth-table reducible to sparse sets
Ronald V. Book
,
Ker-I Ko
SIAM Journal on Computing
17
, 1988, pp. 903-919
Seiten 1
2
3
>