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: Series=LNCS AND YEAR=1986
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Isomorphisms and
1-L
reductions
E. Allender
Lecture Notes in Computer Science
223
, 1986, pp. 12-22
Randomness, relativizations, and polynomial reducibilties
K. Ambos-Spies
Lecture Notes in Computer Science
223
, 1986, pp. 23-34
On non-uniform polynomial space
J. Balcázar
,
J. Díaz
,
J. Gabarró
Lecture Notes in Computer Science
223
, 1986, pp. 35-50
One-way functions and circuit complexity
R. Boppana
,
J. Lagarias
Lecture Notes in Computer Science
223
, 1986, pp. 51-65
Relativized alternation
J. Buss
Lecture Notes in Computer Science
223
, 1986, pp. 66-76
The polynomial hierarchy and intuitionistic bounded arithmetic
S. Buss
Lecture Notes in Computer Science
223
, 1986, pp. 77-103
The Booelan hierarchy
J. Cai
,
L. Hemachandra
Lecture Notes in Computer Science
223
, 1986, pp. 105-124
Exponential time and bounded arithmetic
P. Clote
,
G. Takeutei
Lecture Notes in Computer Science
223
, 1986, pp. 125-143
Probabilistic game automata
A. Condon
,
R. Ladner
Lecture Notes in Computer Science
223
, 1986, pp. 144-162
Two lower bound arguments with ``inaccessible'' numbers
M. Dietzfelbinger
,
W. Maass
Lecture Notes in Computer Science
223
, 1986, pp. 163-183
Resource-bounded Kolmogorov complexity of hard languages
D. Huynh
Lecture Notes in Computer Science
223
, 1986, pp. 184-195
The power of the queue
M. Li
,
L. Longpré
,
P. Vitányi
Lecture Notes in Computer Science
223
, 1986, pp. 219-233
A depth-size tradeoff for Boolean circuits with unbounded fan-in
J. Lynch
Lecture Notes in Computer Science
223
, 1986, pp. 234-248
An optimal lower bound for Turing machines with one work tape and a two-way input tape
W. Maass
,
G. Schnitger
Lecture Notes in Computer Science
223
, 1986, pp. 249-264
Separation results for bounded alternation
K. McAloon
Lecture Notes in Computer Science
223
, 1986, pp. 265-271
Parallel computation with threshold functions
I. Parberry
,
G. Schnitger
Lecture Notes in Computer Science
223
, 1986, pp. 272-290
The topology of provability in complexity theory
K. Regan
Lecture Notes in Computer Science
223
, 1986, pp. 291-310
Optimal approximations of complete sets
D. Russo
Lecture Notes in Computer Science
223
, 1986, pp. 311-324
Expanders, randomness, or time versus space
M. Sipser
Lecture Notes in Computer Science
223
, 1986, pp. 325-329
Diagonalisation methods in a polynomial setting
L. Torenvliet
,
P. van Emde Boas
Lecture Notes in Computer Science
223
, 1986, pp. 330-346
Bounded oracles and complexity classes inside linear space
C. Tretkoff
Lecture Notes in Computer Science
223
, 1986, pp. 347-361
Parallel computation and the NC hierarchy relativized
C. Wilson
Lecture Notes in Computer Science
223
, 1986, pp. 362-382
Probabilistic quantifiers, adversaries, and complexity classes
S. Zachos
Lecture Notes in Computer Science
223
, 1986, pp. 383-400
On Equivalence Transformations for Term Rewriting
Toyama Yoshihito
Lecture Notes in Computer Science
220
, 1986, pp. 44-61
Efficient Factoring Based on Partial Information
Ronald L. Rivest
,
Adi Shamir
Lecture Notes in Computer Science
219
, 1986, pp. 31-34
Seiten
<
1
2
3
4
5
6
7
>