 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl 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 Volume=900 |
|
-
On the structure of log-space probabilistic complexity classes
Ioan I. Macarie
Lecture Notes in Computer Science 900, 1995, pp. 583-596 -
Resource-bounded instance complexity
Lance Fortnow, Martin Kummer
Lecture Notes in Computer Science 900, 1995, pp. 597-608 -
On the sparse set conjecture for sets with low density
Harry Buhrman, Montserrat Hermo
Lecture Notes in Computer Science 900, 1995, pp. 609-618 -
Beyond P^{NP} = NEXP
Stephen A. Fenner, Lance J. Fortnow
Lecture Notes in Computer Science 900, 1995, pp. 619-627 -
Malign distributions for average case circuit complexity
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Lecture Notes in Computer Science 900, 1995, pp. 628-639 -
A possible code in the genetic code
Didier G. Arquès, Christian J. Michel
Lecture Notes in Computer Science 900, 1995, pp. 640-651
|
|
|