DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Carsten Lund
Carsten Lund
Interactive Proof Systems and Alternating Time-Space Complexity
Interactive Proofs
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/Poly
A Study of the NEXP Vs. P/Poly Problem and Its Variants by Barıs
Zk-Snarks: a Gentle Introduction
A Note on NP ∩ Conp/Poly Copyright C 2000, Vinodchandran N
Decoding Downset Codes Over a Finite Grid
Arxiv:2105.01193V1
Lecture 5A Non-Uniformity - Some Background Amnon Ta-Shma and Dean Doron
Lecture 13 1 #P Is in IP
Proof Verification and Hardness of Approximation Problems
SPECIAL ISSUE on WORST-CASE VERSUS AVERAGE-CASE COMPLEXITY Editors’ Foreword
Curriculum Vitae for Mikkel Thorup (Generated July 21, 2020)
Federated Computing Research Conference, FCRC’96, Which Is David Wise, Steering Being Held May 20 - 28, 1996 at the Philadelphia Downtown Marriott
Decoding Downset Codes Over a Grid
Quadratic Span Programs and Succinct Nizks Without Pcps
Rajeev Motwani
On the Power of Many One-Bit Provers
Top View
STOC ’98 to Qualify for the Early Registration Fee, Your Registra- Tion Application Must Be Postmarked by Thursday, April 30, 1998
Lance Jeremy Fortnow Academic & Research Positions Education
Pcps and Instance Compression from a Cryptographic Lens
Probabilistic Checking of Proofs and Hardness of Approximation Problems
Lecture 26: QIP and QMIP 1 Introduction 2 Definition Of
Sublinear-Time Computation in the Presence of an Online Adversary
Interactive Oracle Proofs?
The Projection Games Conjecture and the NP-Hardness of Ln N
Novel Frameworks for Mining Heterogeneous and Dynamic
Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols
Randomization, Random Walks, Derandomization, Expansion
A Note on Set Cover Inapproximability Independent of Universe Size
Probabilistically Checkable Proofs and Hardness of Approximation
UG-Hardness to NP-Hardness by Losing Half
Algebraic Methods for Interactive Proof Systems
A Multi-Prover Interactive Proof for NEXP Sound Against Entangled Provers
Lecture 15,16: IP=PSPACE Instructor: Rafael Pass Scribe: Ashwinkumar B
Towards a Quantum-Inspired Proof for $IP =PSPACE $
Introductory Lecture 1 What This Course Is About
Karp-Lipton Style Theorems CS388T, Spring 2020 Instructor: Prof
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
The Power of Adaptiveness and Additional Queries in Random Self
Curriculum Vitae
A History of the PCP Theorem
Delegating Computation Via No-Signaling Strategies
Lecture 15 1 Introduction
Functions with and Without Small Circuits 1 Introduction
Variable Selection Is Hard
The Complexity of Zero Knowledge
Parallel Repetition of Two Prover Games