Fortnow, L.: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

The status of the P versus NP problem

Journal:

Communications of the ACM

Year:

2009

Language:

english

File:

PDF, 9.33 MB

english, 2009

2

One Complexity Theorist's View of Quantum Computing

Journal:

Electronic Notes in Theoretical Computer Science

Year:

2000

File:

PDF, 767 KB

2000

3

Gaming Prediction Markets: Equilibrium Strategies with a Market Maker

Yiling Chen, Stanko Dimitrov, Rahul Sami, Daniel M. Reeves, David M. Pennock, Robin D. Hanson, Lance Fortnow, Rica Gonen

Journal:

Year:

2010

Language:

english

File:

PDF, 732 KB

english, 2010

4

[ACM Press the twenty-third annual ACM symposium - New Orleans, Louisiana, United States (1991.05.05-1991.05.08)] Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 - Checking computations in polylogarithmic time

Babai, László, Fortnow, Lance, Levin, Leonid A., Szegedy, Mario

Year:

1991

Language:

english

File:

PDF, 1.13 MB

english, 1991

5

Sipser Michael. Introduction to the theory of computation. PWS Publishing Company, Boston etc. 1997, xv + 396 pp.

Journal:

Journal of Symbolic Logic

Year:

1999

Language:

english

File:

PDF, 248 KB

english, 1999

6

Some Results on Derandomization

Harry Buhrman, Lance Fortnow, A. Pavan

Journal:

Theory of Computing Systems

Year:

2005

Language:

english

File:

PDF, 214 KB

english, 2005

7

An oracle builder’s toolkit

Stephen Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li

Journal:

Information and Computation

Year:

2003

Language:

english

File:

PDF, 373 KB

english, 2003

8

Separating Complexity Classes Using Autoreducibility

Buhrman, Harry, Fortnow, Lance, van Melkebeek, Dieter, Torenvliet, Leen

Journal:

SIAM Journal on Computing

Year:

2000

Language:

english

File:

PDF, 268 KB

english, 2000

9

L-Printable Sets

Fortnow, Lance, Goldsmith, Judy, Levy, Matthew A., Mahaney, Stephen

Journal:

SIAM Journal on Computing

Year:

1998

Language:

english

File:

PDF, 323 KB

english, 1998

10

The Enduring Legacy of the Turing Machine

Journal:

The Computer Journal

Year:

2012

Language:

english

File:

PDF, 46 KB

english, 2012

11

The Knowledge Complexity of Interactive Proof Systemsby Shafi Goldwasser; Silvio Micali; Charles Rackoff;Proofs that Release Minimum Knowledgeby Oded Goldreich; Silvio Micali; Avi Wigderson; J. Gruska; B. Rovan; J. Wiedermann;Randomness, Interactive Proofs, and Zero-Knowledge--A Surveyby Oded Goldreich; Rolf Herken

Review by: Lance Fortnow

Journal:

Journal of Symbolic Logic

Year:

1991

Language:

english

File:

PDF, 455 KB

english, 1991

12

Gap-definable counting classes

Stephen A. Fenner, Lance J. Fortnow, Stuart A. Kurtz

Journal:

Journal of Computer and System Sciences

Year:

1994

Language:

english

File:

PDF, 1.51 MB

english, 1994

13

Arithmetization: A new method in structural complexity theory

László Babai, Lance Fortnow

Journal:

Computational Complexity

Year:

1991

Language:

english

File:

PDF, 1.56 MB

english, 1991

14

On the Complexity of Succinct Zero-Sum Games

Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans

Journal:

Computational Complexity

Year:

2008

Language:

english

File:

PDF, 557 KB

english, 2008

15

Sophistication Revisited

Luís Antunes, Lance Fortnow

Journal:

Theory of Computing Systems

Year:

2009

Language:

english

File:

PDF, 278 KB

english, 2009

16

Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?

Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolay Vereshchagin

Journal:

Theory of Computing Systems

Year:

2010

Language:

english

File:

PDF, 373 KB

english, 2010

17

The Complexity of Forecast Testing

Lance Fortnow, Rakesh V. Vohra

Journal:

Year:

2009

Language:

english

File:

PDF, 134 KB

english, 2009

18

Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time

Czumaj, Artur, Ergün, Funda, Fortnow, Lance, Magen, Avner, Newman, Ilan, Rubinfeld, Ronitt, Sohler, Christian

Journal:

SIAM Journal on Computing

Year:

2005

Language:

english

File:

PDF, 253 KB

english, 2005

19

[IEEE 2010 IEEE 25th Annual Conference on Computational Complexity (CCC) - Cambridge, MA, USA (2010.06.9-2010.06.12)] 2010 IEEE 25th Annual Conference on Computational Complexity - Derandomizing from Random Strings

Buhrman, Harry, Fortnow, Lance, Koucký, Michal, Loff, Bruno

Year:

2010

Language:

english

File:

PDF, 329 KB

english, 2010

20

[IEEE Comput. Soc. Press [1990] 31st Annual Symposium on Foundations of Computer Science - St. Louis, MO, USA (22-24 Oct. 1990)] Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science - Nondeterministic exponential time has two-prover interactive protocols

Babai, L., Fortnow, L., Lund, C.

Year:

1990

Language:

english

File:

PDF, 890 KB

english, 1990

21

[IEEE Comput. Soc Computational Complexity. Sixteenth Annual IEEE Conference - Chicago, IL, USA (18-21 June 2001)] Proceedings 16th Annual IEEE Conference on Computational Complexity - Comparing notions of full derandomization

Year:

2000

Language:

english

File:

PDF, 551 KB

english, 2000

22

[Handbook of the History of Logic] Computational Logic Volume 9 || Computational Complexity

Year:

2014

Language:

english

File:

PDF, 269 KB

english, 2014

23

[ACM Press the 9th ACM conference - Chicago, Il, USA (2008.07.08-2008.07.12)] Proceedings of the 9th ACM conference on Electronic commerce - EC '08 - Complexity of combinatorial market makers

Chen, Yiling, Fortnow, Lance, Lambert, Nicolas, Pennock, David M., Wortman, Jennifer

Year:

2008

Language:

english

File:

PDF, 234 KB

english, 2008

24

[ACM Press the nineteenth annual ACM conference - New York, New York, United States (1987..-..)] Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 - The complexity of perfect zero-knowledge

Year:

1987

Language:

english

File:

PDF, 592 KB

english, 1987

25

A Survey of Marketing Researchby Dik Warren Twedt

Review by: Paul H. Fortnow

Journal:

Journal of Marketing Research

Year:

1964

Language:

english

File:

PDF, 550 KB

english, 1964

26

Loopholes

Chung, Kim-Sau, Fortnow, Lance

Journal:

The Economic Journal

Year:

2015

Language:

english

File:

PDF, 351 KB

english, 2015

27

The Golden Ticket (P, NP, and the Search for the Impossible) || Chapter 5 The Prehistory of P versus NP

Year:

2013

File:

PDF, 233 KB

2013

28

The Golden Ticket (P, NP, and the Search for the Impossible) || Chapter 7 Proving P ≠ NP

Year:

2013

File:

PDF, 388 KB

2013

29

Book Review: A Survey of Marketing Research

Fortnow, Paul H.

Journal:

Journal of Marketing Research

Year:

1964

File:

PDF, 529 KB

1964

30

Generic Separations

Lance Fortnow, Tomoyuki Yamakami

Journal:

Journal of Computer and System Sciences

Year:

1996

Language:

english

File:

PDF, 405 KB

english, 1996

31

Complexity Limitations on Quantum Computation

Lance Fortnow, John Rogers

Journal:

Journal of Computer and System Sciences

Year:

1999

Language:

english

File:

PDF, 141 KB

english, 1999

32

Two Queries

Harry Buhrman, Lance Fortnow

Journal:

Journal of Computer and System Sciences

Year:

1999

Language:

english

File:

PDF, 162 KB

english, 1999

33

Time–Space Tradeoffs for Satisfiability

Journal:

Journal of Computer and System Sciences

Year:

2000

Language:

english

File:

PDF, 180 KB

english, 2000

34

GUEST EDITOR'S FOREWORD

Journal:

Journal of Computer and System Sciences

Year:

2001

Language:

english

File:

PDF, 33 KB

english, 2001

35

On the power of two-local random reductions

Lance Fortnow, Mario Szegedy

Journal:

Information Processing Letters

Year:

1992

Language:

english

File:

PDF, 349 KB

english, 1992

36

Extremes in the degrees of inferability

Lance Fortnow, William Gasarch, Sanjay Jain, Efim Kinber, Martin Kummer, Stuart Kurtz, Mark Pleszkovich, Theodore Slaman, Robert Solovay, Frank Stephan

Journal:

Annals of Pure and Applied Logic

Year:

1994

Language:

english

File:

PDF, 2.90 MB

english, 1994

37

Interactive proof systems and alternating time—space complexity

Lance Fortnow, Carsten Lund

Journal:

Theoretical Computer Science

Year:

1993

Language:

english

File:

PDF, 1.29 MB

english, 1993

38

On the power of multi-prover interactive protocols

Lance Fortnow, John Rompel, Michael Sipser

Journal:

Theoretical Computer Science

Year:

1994

Language:

english

File:

PDF, 920 KB

english, 1994

39

On resource-bounded instance complexity

Lance Fortnow, Martin Kummer

Journal:

Theoretical Computer Science

Year:

1996

Language:

english

File:

PDF, 1.24 MB

english, 1996

40

Prediction and dimension

Lance Fortnow, Jack H. Lutz

Journal:

Journal of Computer and System Sciences

Year:

2005

Language:

english

File:

PDF, 299 KB

english, 2005

41

Proving SAT does not have small circuits with an application to the two queries problem

Lance Fortnow, A. Pavan, Samik Sengupta

Journal:

Journal of Computer and System Sciences

Year:

2008

Language:

english

File:

PDF, 105 KB

english, 2008

42

Efficient learning algorithms yield circuit lower bounds

Lance Fortnow, Adam R. Klivans

Journal:

Journal of Computer and System Sciences

Year:

2009

Language:

english

File:

PDF, 180 KB

english, 2009

43

Infeasibility of instance compression and succinct PCPs for NP

Lance Fortnow, Rahul Santhanam

Journal:

Journal of Computer and System Sciences

Year:

2011

Language:

english

File:

PDF, 240 KB

english, 2011

44

Computation in a distributed information market

Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami

Journal:

Theoretical Computer Science

Year:

2005

Language:

english

File:

PDF, 256 KB

english, 2005

45

Relativized worlds with an infinite hierarchy

Journal:

Information Processing Letters

Year:

1999

Language:

english

File:

PDF, 518 KB

english, 1999

46

One complexity theorist's view of quantum computing

Journal:

Theoretical Computer Science

Year:

2003

Language:

english

File:

PDF, 145 KB

english, 2003

47

Uniformly hard languages

Rod Downey, Lance Fortnow

Journal:

Theoretical Computer Science

Year:

2003

Language:

english

File:

PDF, 163 KB

english, 2003

48

On the relative sizes of learnable sets

Lance Fortnow, Rūsiņs̆ Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan

Journal:

Theoretical Computer Science

Year:

1998

Language:

english

File:

PDF, 1.19 MB

english, 1998

49

Non-deterministic exponential time has two-prover interactive protocols

László Babai, Lance Fortnow, Carsten Lund

Journal:

Computational Complexity

Year:

1991

Language:

english

File:

PDF, 2.43 MB

english, 1991

50

Non-deterministic exponential time has two-prover interactive protocols

L. Babai, L. Fortnow, C. Lund

Journal:

Computational Complexity

Year:

1992

File:

PDF, 24 KB

1992