On the public citation graph
Non-deterministic exponential time has two-prover interactive protocols
0 signed · 473 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-52282-4_30openalex-snapshot
Hiding instances in multioracle queries
inferredcites →https://doi.org/10.1007/bf01200057openalex-snapshot
Arithmetization: A new method in structural complexity theory
inferredcites →https://doi.org/10.1007/bfb0036938openalex-snapshot
Complexity classes of alternating machines with oracles
inferredcites →https://doi.org/10.1016/0020-0190(88)90199-8openalex-snapshot
Are there interactive protocols for co-NP languages?
inferredcites →https://doi.org/10.1016/0022-0000(88)90028-1openalex-snapshot
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1016/0890-5401(89)90022-9openalex-snapshot
Relativized Arthur-Merlin versus Merlin-Arthur games
inferredcites →https://doi.org/10.1016/s0019-9958(85)80004-8openalex-snapshot
Sparse sets in NP-P: EXPTIME versus NEXPTIME
inferredcites →https://doi.org/10.1016/s0019-9958(86)80012-2openalex-snapshot
On relativized exponential and probabilistic complexity classes
inferredcites →https://doi.org/10.1016/s0304-0208(08)73487-xopenalex-snapshot
Representation of Group Elements as Short Products
inferredcites →https://doi.org/10.1017/s0269964800000267openalex-snapshot
On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
inferredcites →https://doi.org/10.1109/fscs.1990.89518openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1109/mahc.1984.10036openalex-snapshot
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
inferredcites →https://doi.org/10.1109/psct.1987.10319265openalex-snapshot
The Complexity of Perfect Zero-Knowledge
inferredcites →https://doi.org/10.1109/sct.1988.5275openalex-snapshot
On the power of multi-power interactive protocols
inferredcites →https://doi.org/10.1109/sct.1990.113952openalex-snapshot
E-mail and the unexpected power of interaction
inferredcites →https://doi.org/10.1109/sfcs.1989.63527openalex-snapshot
On the computational power of PP and (+)P
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/100216.100225openalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
inferredcites →https://doi.org/10.1145/22145.22192openalex-snapshot
Trading group theory for randomness
inferredcites →https://doi.org/10.1145/322047.322061openalex-snapshot
Separating Nondeterministic Time Complexity Classes
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/62212.62223openalex-snapshot
Multi-prover interactive proofs: how to remove intractability
inferredcites →https://doi.org/10.1145/73007.73015openalex-snapshot
Designing programs that check their work
inferredcites →https://doi.org/10.1145/800141.804678openalex-snapshot
Some connections between nonuniform and uniform complexity classes
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19980440412openalex-snapshot
The Analytic Polynomial‐Time Hierarchy
inferred← citeshttps://doi.org/10.1002/rsa.10023openalex-snapshot
Testing properties of directed graphs: acyclicity and connectivity
inferred← citeshttps://doi.org/10.1002/rsa.20120openalex-snapshot
Robust Locally Testable Codes and Products of Codes
inferred← citeshttps://doi.org/10.1002/rsa.20498openalex-snapshot
A combination of testability and decodability by tensor products
inferred← citeshttps://doi.org/10.1002/rsa.20507openalex-snapshot
A unified framework for testing linear‐invariant properties
inferred← citeshttps://doi.org/10.1006/jcss.1996.0061openalex-snapshot
P-Selective Sets and Reducing Search to Decision vs Self-Reducibility
inferred← citeshttps://doi.org/10.1006/jcss.1996.0066openalex-snapshot
Multi-prover Encoding Schemes and Three-prover Proof Systems
inferred← citeshttps://doi.org/10.1006/jcss.1997.1238openalex-snapshot
Fully Parallelized Multi-prover Protocols for NEXP-Time
inferred← citeshttps://doi.org/10.1006/jcss.2001.1780openalex-snapshot
Randomness vs Time: Derandomization under a Uniform Assumption
inferred← citeshttps://doi.org/10.1006/jcss.2002.1835openalex-snapshot
New Lowness Results for ZPPNP and Other Complexity Classes
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_7openalex-snapshot
Approximability of NP-Optimization Problems
inferred← citeshttps://doi.org/10.1007/0-387-23830-1_3openalex-snapshot
Probabilistic Verification and Non-Approximability
inferred← citeshttps://doi.org/10.1007/11590156_2openalex-snapshot
Computational Complexity Since 1980
inferred← citeshttps://doi.org/10.1007/11672142_12openalex-snapshot
Entanglement in Interactive Proof Systems with Binary Answers
inferred← citeshttps://doi.org/10.1007/3-540-32743-6_8openalex-snapshot
Von der Turingmaschine zum Quantencomputer — ein Gang durch die Geschichte der Komplexitätstheorie
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_11openalex-snapshot
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_20openalex-snapshot
Some Results on Derandomization
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_5openalex-snapshot
Security with Low Communication Overhead
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_29openalex-snapshot
Small PCPs with Low Query Complexity
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_68openalex-snapshot
Testing Acyclicity of Directed Graphs in Sublinear Time
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_16openalex-snapshot
A Probabilistic-Time Hierarchy Theorem for “Slightly Non-uniform” Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-46766-1_17openalex-snapshot
Interactive Proofs with Space Bounded Provers
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_64openalex-snapshot
Many-Valued Logics and Holographic Proofs
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_21openalex-snapshot
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_8openalex-snapshot
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_73openalex-snapshot
Structural complexity theory: Recent surprises
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_54openalex-snapshot
Oracles versus proof techniques that do not relativize
inferred← citeshttps://doi.org/10.1007/3-540-54487-9_63openalex-snapshot
Interactive proof systems: Provers, rounds, and error bounds
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_57openalex-snapshot
Program result checking: A new approach to making programs more reliable
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_72openalex-snapshot
Fault-tolerance and complexity (Extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_21openalex-snapshot
Recent results in hardness of approximation
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_175openalex-snapshot
On helping and interactive proof systems
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_130openalex-snapshot
My favorite ten complexity theorems of the past decade
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_74openalex-snapshot
New collapse consequences of NP having small circuits
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_53openalex-snapshot
On self-testing without the generator bottleneck
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_165openalex-snapshot
A formal framework for evaluating heuristic programs
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_5openalex-snapshot
A Taxonomy of Proof Systems
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_147openalex-snapshot
Quantum Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_5openalex-snapshot
Property Testing in Massive Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-17653-2_4openalex-snapshot
Aurora: Transparent Succinct Arguments for R1CS
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_25openalex-snapshot
Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup
inferred← citeshttps://doi.org/10.1007/978-3-030-80627-9_7openalex-snapshot
Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-84242-0_26openalex-snapshot
Sumcheck Arguments and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-85472-0_4openalex-snapshot
Quantum Correlations: Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-90453-1_15openalex-snapshot
On Derandomizing Yao’s Weak-to-Strong OWF Construction
inferred← citeshttps://doi.org/10.1007/978-3-032-35424-2_18openalex-snapshot
NeutronNova: Group-Based Folding Done Right
inferred← citeshttps://doi.org/10.1007/978-3-0348-9110-3_2openalex-snapshot
Transparent Proofs and Limits to Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-43669-2_10openalex-snapshot
Complexity Barriers as Independence
inferred← citeshttps://doi.org/10.1007/978-3-319-49571-2_4openalex-snapshot
Nonlocality in Multipartite Quantum States
inferred← citeshttps://doi.org/10.1007/978-3-319-61273-7_25openalex-snapshot
Multi-prover Interactive Proofs: Unsound Foundations
inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_6openalex-snapshot
Zero Knowledge Protocols from Succinct Constraint Detection
inferred← citeshttps://doi.org/10.1007/978-3-319-70700-6_6openalex-snapshot
Succinct Spooky Free Compilers Are Not Black Box Sound
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_21openalex-snapshot
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_17openalex-snapshot
Testing Low-Degree Polynomials over GF(2)
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_25openalex-snapshot
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_55openalex-snapshot
Product Theorems Via Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_36openalex-snapshot
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_49openalex-snapshot
Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_5openalex-snapshot
The Complexity of Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_1openalex-snapshot
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_39openalex-snapshot
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_12openalex-snapshot
Towards a Study of Low-Complexity Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_18openalex-snapshot
Unconditional Lower Bounds against Advice
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_1openalex-snapshot
Avoiding Simplicity Is Complex
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_13openalex-snapshot
Polynomial-Space Approximation of No-Signaling Provers
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_7openalex-snapshot
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_26openalex-snapshot
Improved Delegation of Computation Using Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_12openalex-snapshot
Invariance in Property Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_18openalex-snapshot
Testing Linear-Invariant Non-linear Properties: A Short Report
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_19openalex-snapshot
Optimal Testing of Reed-Muller Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_25openalex-snapshot
Symmetric LDPC Codes and Local Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_6openalex-snapshot
Short Locally Testable Codes and Proofs: A Survey in Two Parts
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_35openalex-snapshot
Towards Non-Black-Box Lower Bounds in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_13openalex-snapshot
Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_48openalex-snapshot
Robust Simulations and Significant Separations
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_25openalex-snapshot
Short Locally Testable Codes and Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_4openalex-snapshot
Almost Transparent Short Proofs for NPℝ
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_14openalex-snapshot
Hard Functions for Low-Degree Polynomials over Prime Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-23297-8openalex-snapshot
Universal Semantic Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_22openalex-snapshot
Two Provers in Isolation
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_428-3openalex-snapshot
Quantum Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_9openalex-snapshot
On Efficient Zero-Knowledge PCPs
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_40openalex-snapshot
On the Advice Complexity of Tournaments
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_16openalex-snapshot
Succinct Permanent Is NEXP-Hard with Many Hard Instances
inferred← citeshttps://doi.org/10.1007/978-3-642-61012-7_17openalex-snapshot
Wie man Beweise verifiziert, ohne sie zu lesen
inferred← citeshttps://doi.org/10.1007/978-3-642-79958-7_2openalex-snapshot
Probabilistically Checkable Proofs and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-12521-2openalex-snapshot
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_27openalex-snapshot
Characterization of Binary Constraint System Games
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_29openalex-snapshot
Interactive Proofs with Approximately Commuting Provers
inferred← citeshttps://doi.org/10.1007/978-3-662-49099-0_2openalex-snapshot
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_13openalex-snapshot
Robust Secret Sharing Schemes Against Local Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-7091-9239-9_15openalex-snapshot
Features of Computer Language: Communication of Computers and Its Complexity
inferred← citeshttps://doi.org/10.1007/bf00190804openalex-snapshot
A low communication competitive interactive proof system for promised quadratic residuosity
inferred← citeshttps://doi.org/10.1007/bf01200057openalex-snapshot
Arithmetization: A new method in structural complexity theory
inferred← citeshttps://doi.org/10.1007/bf01202287openalex-snapshot
The power of adaptiveness and additional queries in random-self-reductions
inferred← citeshttps://doi.org/10.1007/bf01271372openalex-snapshot
The complexity of the max word problem and the power of one-way interactive proof systems
inferred← citeshttps://doi.org/10.1007/bf01275486openalex-snapshot
BPP has subexponential time simulations unlessEXPTIME has publishable proofs
inferred← citeshttps://doi.org/10.1007/bf01276436openalex-snapshot
On being incoherent without being very hard
inferred← citeshttps://doi.org/10.1007/bf01585569openalex-snapshot
The complexity of approximating a nonlinear program
inferred← citeshttps://doi.org/10.1007/bf01940870openalex-snapshot
Simulating BPP using a general weak random source
inferred← citeshttps://doi.org/10.1007/bf02362268openalex-snapshot
Probabilistic verification of proofs in calculuses
inferred← citeshttps://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferred← citeshttps://doi.org/10.1007/bfb0023486openalex-snapshot
An information-theoretic treatment of random-self-reducibility
inferred← citeshttps://doi.org/10.1007/bfb0055799openalex-snapshot
Average-case intractability vs. worst-case intractability
inferred← citeshttps://doi.org/10.1007/pl00001606openalex-snapshot
Small PCPs with low query complexity
inferred← citeshttps://doi.org/10.1007/s00037-003-0178-7openalex-snapshot
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
inferred← citeshttps://doi.org/10.1007/s00037-004-0182-6openalex-snapshot
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/s00037-007-0232-yopenalex-snapshot
Special Issue On Worst-case Versus Average-case Complexity Editors’ Foreword
inferred← citeshttps://doi.org/10.1007/s00037-007-0233-xopenalex-snapshot
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
inferred← citeshttps://doi.org/10.1007/s00037-008-0250-4openalex-snapshot
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
inferred← citeshttps://doi.org/10.1007/s00037-008-0252-2openalex-snapshot
On the Complexity of Succinct Zero-Sum Games
inferred← citeshttps://doi.org/10.1007/s00037-009-0263-7openalex-snapshot
The Black-Box Query Complexity of Polynomial Summation
inferred← citeshttps://doi.org/10.1007/s00037-009-0275-3openalex-snapshot
Using Entanglement in Quantum Multi-Prover Interactive Proofs
inferred← citeshttps://doi.org/10.1007/s00037-009-0277-1openalex-snapshot
Space Hierarchy Results for Randomized and other Semantic Models
inferred← citeshttps://doi.org/10.1007/s00037-011-0014-4openalex-snapshot
PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability
inferred← citeshttps://doi.org/10.1007/s00037-012-0055-3openalex-snapshot
2-Transitivity is Insufficient for Local Testability
inferred← citeshttps://doi.org/10.1007/s00037-014-0080-5openalex-snapshot
Combinatorial PCPs with Efficient Verifiers
inferred← citeshttps://doi.org/10.1007/s00037-016-0149-4openalex-snapshot
Low-degree test with polynomially small error
inferred← citeshttps://doi.org/10.1007/s001459900017openalex-snapshot
Locally random reductions: Improvements and applications
inferred← citeshttps://doi.org/10.1007/s00220-017-2880-3openalex-snapshot
Quantum de Finetti Theorems Under Local Measurements with Applications
inferred← citeshttps://doi.org/10.1007/s00224-011-9334-7openalex-snapshot
Avoiding Simplicity is Complex
inferred← citeshttps://doi.org/10.1007/s00224-014-9547-7openalex-snapshot
The Complexity of Debate Checking
inferred← citeshttps://doi.org/10.1007/s00224-015-9639-zopenalex-snapshot
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness
inferred← citeshttps://doi.org/10.1007/s00453-001-0078-7openalex-snapshot
Property Testing in Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1007/s00453-007-9033-6openalex-snapshot
Quantum Information and the PCP Theorem
inferred← citeshttps://doi.org/10.1007/s00493-014-2715-1openalex-snapshot
Symmetric LDPC codes and local testing
inferred← citeshttps://doi.org/10.1007/s004930050060openalex-snapshot
A Sublinear Bipartiteness Tester for Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1007/s10878-014-9725-1openalex-snapshot
On the computational complexity of bridgecard
inferred← citeshttps://doi.org/10.1007/s10958-009-9403-5openalex-snapshot
Time hierarchies for cryptographic function inversion with advice
inferred← citeshttps://doi.org/10.1007/s11128-007-0068-zopenalex-snapshot
On the Power of Quantum, One Round, Two Prover Interactive Proof Systems
inferred← citeshttps://doi.org/10.1007/s11704-016-6148-4openalex-snapshot
Primitives towards verifiable computation: a survey
inferred← citeshttps://doi.org/10.1007/s13538-021-00998-1openalex-snapshot
Bell Non-Locality in Many-Body Quantum Systems with Exponential Decay of Correlations
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00112-vopenalex-snapshot
Probabilistically checkable proofs and their consequences for approximation algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90103-oopenalex-snapshot
A note on enumerative counting
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90021-aopenalex-snapshot
Multi-oracle interactive protocols with constant space verifiers
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90085-topenalex-snapshot
On games of incomplete information
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90117-copenalex-snapshot
Almost-everywhere complexity hierarchies for nondeterministic time
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90210-kopenalex-snapshot
Interactive proof systems and alternating time—space complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90251-8openalex-snapshot
On the power of multi-prover interactive protocols
inferred← citeshttps://doi.org/10.1016/j.ic.2003.09.005openalex-snapshot
Fast approximate probabilistically checkable proofs
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.001openalex-snapshot
Fast approximate PCPs for multidimensional bin-packing problems
inferred← citeshttps://doi.org/10.1016/j.ic.2017.07.002openalex-snapshot
Robust simulations and significant separations
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.05.005openalex-snapshot
Parallelization of entanglement-resistant multi-prover interactive proofs
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.05.012openalex-snapshot
Constant-space quantum interactive proofs against multiple provers
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.04.010openalex-snapshot
On the probabilistic closure of the loose unambiguous hierarchy
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.006openalex-snapshot
Model-checking hierarchical structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.013openalex-snapshot
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.030openalex-snapshot
Shorter arithmetization of nondeterministic computations
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.001openalex-snapshot
Model independent approach to probabilistic models
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00024-7openalex-snapshot
In search of an easy witness: exponential time vs. probabilistic polynomial time
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00035-7openalex-snapshot
Quantum multi-prover interactive proof systems with limited prior entanglement
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80026-1openalex-snapshot
PSPACE is provable by two provers in one round
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80084-4openalex-snapshot
The random oracle hypothesis is false
inferred← citeshttps://doi.org/10.1016/s0065-2458(09)01204-2openalex-snapshot
Chapter 4 A Status Report on the P Versus NP Question
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00017-8openalex-snapshot
Interactive and probabilistic proof-checking
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00375-9openalex-snapshot
PSPACE has constant-round quantum interactive proof systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00377-2openalex-snapshot
One complexity theorist's view of quantum computing
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00816-2openalex-snapshot
Algebraic testing and weight distributions of codes
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00057-7openalex-snapshot
Bounding queries in the analytic polynomial-time hierarchy
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80330-5openalex-snapshot
One Complexity Theorist's View of Quantum Computing
inferred← citeshttps://doi.org/10.1017/s0963548300000031openalex-snapshot
Local Expansion of Symmetrical Graphs
inferred← citeshttps://doi.org/10.1017/s0963548300001553openalex-snapshot
On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE
inferred← citeshttps://doi.org/10.1017/s0963548315000292openalex-snapshot
On Active and Passive Testing
inferred← citeshttps://doi.org/10.1023/a:1018950418415openalex-snapshot
A formal framework for evaluating heuristic programs
inferred← citeshttps://doi.org/10.1038/s41534-019-0203-6openalex-snapshot
A nonlocal game for witnessing quantum networks
inferred← citeshttps://doi.org/10.1070/im1994v042n02abeh001537openalex-snapshot
RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
inferred← citeshttps://doi.org/10.1080/10637199608915545openalex-snapshot
RECYCLING RANDOM BITS IN PARALLEL
inferred← citeshttps://doi.org/10.1090/bull/1768openalex-snapshot
The Connes embedding problem: A guided tour
inferred← citeshttps://doi.org/10.1090/pcms/010/12openalex-snapshot
Probabilistically checkable proofs
inferred← citeshttps://doi.org/10.1090/psapm/050/1368642openalex-snapshot
The use of coding theory in computational complexity
inferred← citeshttps://doi.org/10.1090/s0273-0979-06-01143-8openalex-snapshot
On Dinur’s proof of the PCP theorem
inferred← citeshttps://doi.org/10.1098/rspa.2016.0003openalex-snapshot
Extended non-local games and monogamy-of-entanglement games
inferred← citeshttps://doi.org/10.1109/18.556674openalex-snapshot
Linearity testing in characteristic two
inferred← citeshttps://doi.org/10.1109/access.2020.3046025openalex-snapshot
Non-Interactive Zero-Knowledge for Blockchain: A Survey
inferred← citeshttps://doi.org/10.1109/ccc.1996.507669openalex-snapshot
Error reduction by parallel repetition-a negative result
inferred← citeshttps://doi.org/10.1109/ccc.1999.766261openalex-snapshot
Proofs, codes, and polynomial-time reducibilities
inferred← citeshttps://doi.org/10.1109/ccc.1999.766280openalex-snapshot
Circuit lower bounds collapse relativized complexity classes
inferred← citeshttps://doi.org/10.1109/ccc.2001.933869openalex-snapshot
Comparing notions of full derandomization
inferred← citeshttps://doi.org/10.1109/ccc.2002.1004348openalex-snapshot
Pseudorandomness and average-case complexity via uniform reductions
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214408openalex-snapshot
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games
inferred← citeshttps://doi.org/10.1109/ccc.2004.24openalex-snapshot
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
inferred← citeshttps://doi.org/10.1109/ccc.2005.16openalex-snapshot
On Constructing Parallel Pseudorandom Generators from One-Way Functions
inferred← citeshttps://doi.org/10.1109/ccc.2006.32openalex-snapshot
Oracles Are Subtle But Not Malicious
inferred← citeshttps://doi.org/10.1109/ccc.2007.24openalex-snapshot
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
inferred← citeshttps://doi.org/10.1109/ccc.2008.12openalex-snapshot
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
inferred← citeshttps://doi.org/10.1109/ccc.2008.26openalex-snapshot
The Quantum Moment Problem and Bounds on Entangled Multi-prover Games
inferred← citeshttps://doi.org/10.1109/ccc.2008.31openalex-snapshot
2-Transitivity Is Insufficient for Local Testability
inferred← citeshttps://doi.org/10.1109/ccc.2008.6openalex-snapshot
Using Entanglement in Quantum Multi-prover Interactive Proofs
inferred← citeshttps://doi.org/10.1109/ccc.2009.21openalex-snapshot
Fixed-Polynomial Size Circuit Bounds
inferred← citeshttps://doi.org/10.1109/ccc.2009.22openalex-snapshot
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
inferred← citeshttps://doi.org/10.1109/ccc.2010.17openalex-snapshot
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
showing the first 200 of 442 · page through all 442
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.