DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Lance Fortnow
Lance Fortnow
Interactive Proof Systems and Alternating Time-Space Complexity
The Complexity Zoo
Delegating Computation: Interactive Proofs for Muggles∗
Interactive Proofs
Simple Doubly-Efficient Interactive Proof Systems for Locally
A Study of the NEXP Vs. P/Poly Problem and Its Variants by Barıs
NP-Complete Problems and Physical Reality
A Note on NP ∩ Conp/Poly Copyright C 2000, Vinodchandran N
April 2017 Table of Contents
Circuit Lower Bounds for Merlin-Arthur Classes
Minimal TSP Tour Is Conp–Complete -… Nearly 42 …
On Fast Heuristic Non-Deterministic Algorithms and Short Heuristic Proofs
Decoding Downset Codes Over a Finite Grid
Complexity with Rod
DRAFT -- DRAFT -- Appendix
Open Problems Column Edited by William Gasarch This
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Checking Computations in Polylogarithmic Time
Top View
Cosmology and Complexity 325
Introduction to Interactive Proofs & the Sumcheck Protocol 1 Introduction
P Vs NP: Invitation to a Poll by Gasarch
Some Estimated Likelihoods for Computational Complexity
The Role of Relativization in Complexity Theory
A New Family of Locally Correctable Codes Based on Degree-Lifted Algebraic Geometry Codes
Probabilistically Checkable Proofs: a Primer
Dinur's Proof of the PCP Theorem
The Future of Computational Complexity Theory: Part I Comments by C
Uniform Derandomization from Pathetic Lower Bounds
Lance Jeremy Fortnow Academic & Research Positions Education
One Complexity Theorist's View of Quantum Computing
The Golden Ticket P, NP, and the Search for the Impossible∗
I Personal Information
Complexity-Theoretic Aspects of Interactive Proof Systems
Kolmogorov Complexity and Computational Complexity∗
Computer Science & Information Science 2018 Catalog
The Role of Relativization in Complexity Theory
The Status of the P Versus NP Problem
Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols
Randomization, Random Walks, Derandomization, Expansion
Unconditional Lower Bounds Against Advice
A Short History of Computational Complexity
Fixed-Polynomial Size Circuit Bounds
Bpp Has Subexponential Time Simulations Unless Exptime Has Publishable Proofs
L4 Complexity Theory I
Complexity Limitations on Quantum Computation 1 Introduction
Probabilistically Checkable Proofs
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Nonrelativizing Separations
Algebraic Methods for Interactive Proof Systems
Current Events Bulletin
NP Might Not Be As Easy As Detecting Unique Solutions
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations
Introductory Lecture 1 What This Course Is About
The Complexity of Equivalence Relations
A Simple Proof of Toda's Theorem
On the Concrete Efficiency of Probabilistically-Checkable Proofs
Promise Problems Meet Pseudodeterminism ∗
My Favorite Ten Complexity Theorems of the Past Decade
My Answers to My P Vs NP Poll by Gasarch
Unconditional Lower Bounds Against Advice
Ilan Newman 1 Personal Details 2 Higher Education 3 Academic
Time-Space Tradeoffs for Satisfiability 1 Introduction
NP with Small Advice
Towards NEXP Versus BPP?
Proposed Course Contents Course Games and Complexity, Beijing May-Jun 2012-04-13
1 Counting Complexity
Lecture Notes, April 14, Probabilistic Polynomial Time And