Fortnow, L.: search on Z-Library

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

Don't use scam websites

51

The power of adaptiveness and additional queries in random-self-reductions

Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel Spielman

Journal:

Computational Complexity

Year:

1994

Language:

english

File:

PDF, 829 KB

english, 1994

52

BPPhas subexponential time simulations unlessEXPTIMEhas publishable proofs

Lźszló Babai, Lance Fortnow, Noam Nisan, Avi Wigderson

Journal:

Computational Complexity

Year:

1993

Language:

english

File:

PDF, 741 KB

english, 1993

53

Two oracles that force a big crunch

H. Buhrman, S. Fenner, L. Fortnow, L. Torenvliet

Journal:

Computational Complexity

Year:

2001

Language:

english

File:

PDF, 376 KB

english, 2001

54

Separability and one-way functions

Lance Fortnow, John D. Rogers

Journal:

Computational Complexity

Year:

2002

Language:

english

File:

PDF, 233 KB

english, 2002

55

A tight lower bound for restricted pir protocols

Richard Beigel, Lance Fortnow, William Gasarch

Journal:

Computational Complexity

Year:

2006

Language:

english

File:

PDF, 140 KB

english, 2006

56

On coherence, random-self-reducibility, and self-correction

J. Feigenbaum, L. Fortnow, S. Laplante, A. Naik

Journal:

Computational Complexity

Year:

1998

Language:

english

File:

PDF, 368 KB

english, 1998

57

" title="Distributionally Hard Languages" naturalRatio volume size="100" >

Distributionally Hard Languages

Journal:

Theory of Computing Systems

Year:

2001

Language:

english

File:

PDF, 92 KB

english, 2001

58

Computational depth: Concept and applications

Luis Antunes, Lance Fortnow, Dieter van Melkebeek, N.V. Vinodchandran

Journal:

Theoretical Computer Science

Year:

2006

Language:

english

File:

PDF, 234 KB

english, 2006

59

Circuit Lower Bounds à la Kolmogorov

L. Fortnow, S. Laplante

Journal:

Information and Computation

Year:

1995

File:

PDF, 390 KB

1995

60

PP Is Closed under Truth-Table Reductions

Lance Fortnow, Nick Reingold

Journal:

Information and Computation

Year:

1996

Language:

english

File:

PDF, 388 KB

english, 1996

61

Gap-Definability as a Closure Property

Stephen Fenner, Lance Fortnow, Lide Li

Journal:

Information and Computation

Year:

1996

Language:

english

File:

PDF, 1.79 MB

english, 1996

62

Inseparability and Strong Hypotheses for Disjoint NP Pairs

Lance Fortnow, Jack H. Lutz, Elvira Mayordomo

Journal:

Theory of Computing Systems

Year:

2012

Language:

english

File:

PDF, 599 KB

english, 2012

63

Are there interactive protocols for co-NP languages?

Lance Fortnow, Michael Sipser

Journal:

Information Processing Letters

Year:

1988

Language:

english

File:

PDF, 319 KB

english, 1988

64

Betting Boolean-style: a framework for trading in securities based on logical formulas

Lance Fortnow, Joe Kilian, David M. Pennock, Michael P. Wellman

Journal:

Decision Support Systems

Year:

2005

Language:

english

File:

PDF, 236 KB

english, 2005

65

Extracting Kolmogorov complexity with applications to dimension zero-one laws

Lance Fortnow, John M. Hitchcock, A. Pavan, N.V. Vinodchandran, Fengming Wang

Journal:

Information and Computation

Year:

2011

Language:

english

File:

PDF, 284 KB

english, 2011

66

Complexity classes of equivalence problems revisited

Lance Fortnow, Joshua A. Grochow

Journal:

Information and Computation

Year:

2011

Language:

english

File:

PDF, 393 KB

english, 2011

67

Inverting onto functions

Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers

Journal:

Information and Computation

Year:

2003

Language:

english

File:

PDF, 133 KB

english, 2003

68

[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 - Algebraic methods for interactive proof systems

Lund, C., Fortnow, L., Karloff, H., Nisan, N.

Year:

1990

Language:

english

File:

PDF, 656 KB

english, 1990

69

Random-Self-Reducibility of Complete Sets

Feigenbaum, Joan, Fortnow, Lance

Journal:

SIAM Journal on Computing

Year:

1993

Language:

english

File:

PDF, 1.65 MB

english, 1993

70

The Isomorphism Conjecture Holds Relative to an Oracle

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

Journal:

SIAM Journal on Computing

Year:

1996

Language:

english

File:

PDF, 1.80 MB

english, 1996

71

Resource-Bounded Kolmogorov Complexity Revisited

Buhrman, Harry, Fortnow, Lance, Laplante, Sophie

Journal:

SIAM Journal on Computing

Year:

2001

Language:

english

File:

PDF, 229 KB

english, 2001

72

Infinitely‐Often Autoreducible Sets

Beigel, Richard, Fortnow, Lance, Stephan, Frank

Journal:

SIAM Journal on Computing

Year:

2006

Language:

english

File:

PDF, 193 KB

english, 2006

73

Quantum Property Testing

Buhrman, Harry, Fortnow, Lance, Newman, Ilan, Röhrig, Hein

Journal:

SIAM Journal on Computing

Year:

2008

Language:

english

File:

PDF, 206 KB

english, 2008

74

Low-Depth Witnesses are Easy to Find

Antunes, Luís, Fortnow, Lance, Pinto, Alexandre, Souto, André

Journal:

Computational Complexity

Year:

2012

Language:

english

File:

PDF, 255 KB

english, 2012

75

Distributionally Hard Languages

L. Fortnow, A. Pavan, A. L. Selman

Journal:

Theory of Computing Systems

Year:

2001

Language:

english

File:

PDF, 92 KB

english, 2001

76

Algebraic methods for interactive proof systems

Lund, Carsten, Fortnow, Lance, Karloff, Howard

Journal:

Journal of the ACM

Year:

1992

Language:

english

File:

PDF, 740 KB

english, 1992

77

[IEEE Comput. Soc Computational Complexity. Twelfth Annual IEEE Conference - Ulm, Germany (24-27 June 1997)] Proceedings of Computational Complexity. Twelfth Annual IEEE Conference - Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability

Year:

1997

Language:

english

File:

PDF, 758 KB

english, 1997

78

Branching Programs and Binary Decision Diagrams: Theory and Applicationsby Ingo Wegener

Review by: Lance Fortnow

Journal:

Year:

2002

Language:

english

File:

PDF, 345 KB

english, 2002

79

Enumerations of the Kolmogorov Function

Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan and Leen Torenvliet

Journal:

Journal of Symbolic Logic

Year:

2006

Language:

english

File:

PDF, 2.23 MB

english, 2006

80

[IEEE Comput. Soc Computational Complexity. Twelfth Annual IEEE Conference - Ulm, Germany (24-27 June 1997)] Proceedings of Computational Complexity. Twelfth Annual IEEE Conference - Six hypotheses in search of a theorem

Buhrman, H., Fortnow, L., Torenvliet, L.

Year:

1997

Language:

english

File:

PDF, 909 KB

english, 1997

81

[IEEE Proceedings., 33rd Annual Symposium on Foundations of Computer Science - Pittsburgh, PA, USA (1992.10.24-1992.10.27)] Proceedings., 33rd Annual Symposium on Foundations of Computer Science - The isomorphism conjecture holds relative to an oracle

Fenner, S., Fortnow, L., Kurtz, S.A.

Year:

1992

Language:

english

File:

PDF, 750 KB

english, 1992

82

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - Fixed-Polynomial Size Circuit Bounds

Fortnow, Lance, Santhanam, Rahul, Williams, Ryan

Year:

2009

Language:

english

File:

PDF, 302 KB

english, 2009

83

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

Antunes, L., Fortnow, L., van Melkebeeck, D.

Year:

2000

Language:

english

File:

PDF, 624 KB

english, 2000

84

[IEEE Comput Soc. Press Sixth Annual Structure in Complexity Theory Conference - Chicago, IL, USA (30 June-3 July 1991)] [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference - PP is closed under truth-table reductions

Fortnow, L., Reingold, N.

Year:

1991

Language:

english

File:

PDF, 197 KB

english, 1991

85

[IEEE 20th Annual IEEE Conference on Computational Complexity (CCC'05) - San Jose, CA, USA (11-15 June 2005)] 20th Annual IEEE Conference on Computational Complexity (CCC'05) - On the Complexity of Succinct Zero-Sum Games

Fortnow, L., Impagliazzo, R., Kabanets, V., Umans, C.

Year:

2005

Language:

english

File:

PDF, 189 KB

english, 2005

86

[IEEE Comput. Soc 2001 IEEE International Conference on Cluster Computing - Newport Beach, CA, USA (8-11 Oct. 2001)] Proceedings 2001 IEEE International Conference on Cluster Computing - Testing random variables for independence and identity

Batu, T., Fischer, E., Fortnow, L., Kumar, R., Rubinfeld, R., White, P.

Year:

2001

Language:

english

File:

PDF, 231 KB

english, 2001

87

[IEEE Comput Soc. Press Sixth Annual Structure in Complexity Theory Conference - Chicago, IL, USA (30 June-3 July 1991)] [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference - BPP has subexponential time simulations unless EXPTIME has publishable proofs

Babai, L., Fortnow, L., Nisan, N., Wigderson, A.

Year:

1991

Language:

english

File:

PDF, 463 KB

english, 1991

88

[IEEE 45th Annual IEEE Symposium on Foundations of Computer Science - Rome, Italy (17-19 Oct. 2004)] 45th Annual IEEE Symposium on Foundations of Computer Science - Hierarchy Theorems for Probabilistic Polynomial Time

Fortnow, L., Santhanam, R.

Year:

2004

Language:

english

File:

PDF, 358 KB

english, 2004

89

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - Worst-Case Running Times for Average-Case Algorithms

Antunes, Luís, Fortnow, Lance

Year:

2009

Language:

english

File:

PDF, 272 KB

english, 2009

90

[IEEE 20th Annual IEEE Conference on Computational Complexity (CCC'05) - San Jose, CA, USA (11-15 June 2005)] 20th Annual IEEE Conference on Computational Complexity (CCC'05) - NP with Small Advice

Fortnow, L., Klivans, A.R.

Year:

2005

Language:

english

File:

PDF, 163 KB

english, 2005

91

[IEEE Comput. Soc. Press [1992] Seventh Annual Structure in Complexity Theory Conference - Boston, MA, USA (22-25 June 1992)] [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference - The power of adaptiveness and additional queries in random-self-reductions

Feigenbaum, J., Fortnow, L., Lund, C., Spielman, D.

Year:

1992

Language:

english

File:

PDF, 770 KB

english, 1992

92

[IEEE Comput. Soc 41st Annual Symposium on Foundations of Computer Science - Redondo Beach, CA, USA (12-14 Nov. 2000)] Proceedings 41st Annual Symposium on Foundations of Computer Science - Testing that distributions are close

Batu, T., Fortnow, L., Rubinfeld, R., Smith, W.D., White, P.

Year:

2000

Language:

english

File:

PDF, 1.06 MB

english, 2000

93

[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 - A characterization of Hash P by arithmetic straight line programs

Babai, L., Fortnow, L.

Year:

1990

Language:

english

File:

PDF, 695 KB

english, 1990

94

[IEEE Comput. Soc Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) - Buffalo, NY, USA (15-18 June 1998)] Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247) - Nonrelativizing separations

Buhrman, H., Fortnow, L., Thierauf, T.

Year:

1998

Language:

english

File:

PDF, 73 KB

english, 1998

95

[IEEE [1988] Proceedings. Structure in Complexity Theory Third Annual Conference - Washington, DC, USA (1988.06.14-1988.06.17)] [1988] Proceedings. Structure in Complexity Theory Third Annual Conference - On the power of multi-power interactive protocols

Fortnow, L., Rompel, J., Sipser, M.

Year:

1988

Language:

english

File:

PDF, 490 KB

english, 1988

96

[IEEE Comput. Soc. Press Computational Complexity (Formerly Structure in Complexity Theory) - Philadelphia, PA, USA (24-27 May 1996)] Proceedings of Computational Complexity (Formerly Structure in Complexity Theory) - Inverting onto functions

Fenner, S.A., Fortnow, L., Naik, A.V., Rogers, J.D.

Year:

1996

Language:

english

File:

PDF, 806 KB

english, 1996

97

[IEEE Comput. Soc 18th IEEE Annual Conference on Computational Complexity - Aarhus, Denmark (7-10 July 2003)] 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. - Proving SAT does not have small circuits with an application to the two queries problem

Fortnow, L., Pavan, A., Sengupta, S.

Year:

2003

Language:

english

File:

PDF, 261 KB

english, 2003

98

[IEEE Comput. Soc Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) - Buffalo, NY, USA (15-18 June 1998)] Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247) - Two queries

Buhrman, H., Fortnow, L.

Year:

1998

Language:

english

File:

PDF, 90 KB

english, 1998

99

[IEEE Twenty-Second Annual IEEE Conference on Computational Complexity - San Diego, CA, USA (2007.06.13-2007.03.16)] Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) - Low-Depth Witnesses are Easy to Find

Antunes, Luis, Fortnow, Lance, Pinto, Alexandre, Souto, Andre

Year:

2007

Language:

english

File:

PDF, 138 KB

english, 2007

100

[IEEE Comput. Soc. Press Computational Complexity (Formerly Structure in Complexity Theory) - Philadelphia, PA, USA (24-27 May 1996)] Proceedings of Computational Complexity (Formerly Structure in Complexity Theory) - L-printable sets

Fortnow, L., Goldsmith, J., Levy, M.A., Mahaney, S.

Year:

1996

Language:

english

File:

PDF, 944 KB

english, 1996