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
[1]
Hilfe
Suche: Author="Fortnow, L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Distributionally hard languages
L. Fortnow
,
A. Pavan
,
A.L. Selman
Theory of Computing Systems
34
(3), 2001, pp. 245-261
Algebraic methods for interactive proof systems
C. Lund
,
L. Fortnow
,
H. Karloff
,
N. Nisan
Journal of the ACM
39
(4), 1992, October, pp. 859-868
Checking computations in polylogarithmic time
L. Babai
,
L. Fortnow
,
L.A. Levin
,
M. Szegedy
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC'91 (New Orleans, Louisiana, May 6-8, 1991)
, 1991, pp. 21-31
Non-deterministic exponential time has two-prover interactive protocols
L. Babai
,
L. Fortnow
,
C. Lund
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 16-25
A characterization of \#P by arithmetic straight line programs
L. Babai
,
L. Fortnow
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 26-34
Errata for ``On the power of multi-prover interactive protocols''
L. Fortnow
,
J. Rompel
,
M. Sipser
Proceedings of the 5th Annual Conference on Structure in Complexity Theory, CSCT'90 (Universitat Politcnica de Catalunya, Barcelona, Spain, July 8-11, 1990)
, 1990, pp. 318-319
Algebraic methods for interactive proof systems
C. Lund
,
L. Fortnow
,
H. Karloff
,
N. Nisan
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 2-10
On the power of multi-prover interactive protocols
L. Fortnow
,
J. Rompel
,
M. Sipser
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 156-161
The complexity of perfect zero-knowledge
L. Fortnow
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 204-209
The complexity of perfect zero-knowledge
L. Fortnow
Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, CSCT'87 (Cornell University, Ithaca, NY, June 16-19, 1987)
, 1987, pp. 156