On the public citation graph
Non-deterministic exponential time has two-prover interactive protocols
0 signed · 483 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/978-1-4614-8806-4_7openalex-snapshot
Information and Computation
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/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
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.89520openalex-snapshot
Nondeterministic exponential time has two-prover interactive protocols
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/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/rsa.10023openalex-snapshot
Testing properties of directed graphs: acyclicity and connectivity
inferred← citeshttps://doi.org/10.1002/rsa.20050openalex-snapshot
Three‐query PCPs with perfect completeness over non‐Boolean domains
inferred← citeshttps://doi.org/10.1002/rsa.20120openalex-snapshot
Robust Locally Testable Codes and Products of Codes
inferred← citeshttps://doi.org/10.1002/rsa.20262openalex-snapshot
Testing low‐degree polynomials over prime fields
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/inco.2000.2885openalex-snapshot
Uniform Generation of NP-Witnesses Using an NP-Oracle
inferred← citeshttps://doi.org/10.1006/jcss.1996.0062openalex-snapshot
P-Selective Self-Reducible Sets: A New Characterization of P
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.1997.1472openalex-snapshot
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
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-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-44750-4_25openalex-snapshot
Improved Efficient Arguments
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-45878-6_2openalex-snapshot
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
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-56503-5_52openalex-snapshot
Transparent (holographic) proofs
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-57568-5_267openalex-snapshot
Recent developments on the approximability of combinatorial problems
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-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-0-387-30440-3_428openalex-snapshot
Quantum Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_14openalex-snapshot
Probabilistic Verification and Non-approximability
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-64378-2_5openalex-snapshot
Batch Verification and Proofs of Proximity with Polylog Overhead
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-031-22318-1_17openalex-snapshot
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-031-22318-1_18openalex-snapshot
Doubly Efficient Interactive Proofs over Infinite and Non-commutative Rings
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_19openalex-snapshot
Structural Complexity of Rational Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-48615-9_4openalex-snapshot
Distributed-Prover Interactive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-68403-6_4openalex-snapshot
Zero-Knowledge IOPs Approaching Witness Length
inferred← citeshttps://doi.org/10.1007/978-3-032-01878-6_20openalex-snapshot
Succinct Arguments for $$\textsf{Batch}\textsf{QMA}$$ and Friends Under 8 Rounds
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_2openalex-snapshot
Time-Space Trade-Offs for Sumcheck
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-0348-9328-2_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-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-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-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-03356-8_9openalex-snapshot
Probabilistically Checkable Arguments
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-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-32512-0_55openalex-snapshot
A Combination of Testability and Decodability by Tensor Products
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-40450-4_58openalex-snapshot
Improved Approximation Algorithms for Projection Games
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-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-662-53644-5_2openalex-snapshot
Interactive Oracle Proofs
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/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/bfb0020804openalex-snapshot
Interactive proof systems and alternating time-space complexity
inferred← citeshttps://doi.org/10.1007/bfb0023486openalex-snapshot
An information-theoretic treatment of random-self-reducibility
inferred← citeshttps://doi.org/10.1007/bfb0023492openalex-snapshot
Probabilistic proof systems — A survey
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/s00023-024-01426-1openalex-snapshot
Synchronous Values of Games
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-0252-2openalex-snapshot
On the Complexity of Succinct Zero-Sum Games
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-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/s00037-023-00241-0openalex-snapshot
The Power of Natural Properties as Oracles
inferred← citeshttps://doi.org/10.1007/s00037-024-00260-5openalex-snapshot
On the Structure of Learnability beyond P/poly
inferred← citeshttps://doi.org/10.1007/s00145-025-09551-8openalex-snapshot
Public-Coin Three-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash
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/s00220-025-05421-3openalex-snapshot
Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
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-007-9033-6openalex-snapshot
Quantum Information and the PCP Theorem
inferred← citeshttps://doi.org/10.1007/s00453-015-0088-5openalex-snapshot
Improved Approximation Algorithms for Projection Games
inferred← citeshttps://doi.org/10.1007/s00493-014-2715-1openalex-snapshot
Symmetric LDPC codes and local testing
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/s11128-024-04448-0openalex-snapshot
Quantum interactive proofs using quantum energy teleportation
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.1007/s40879-024-00803-8openalex-snapshot
Stability of homomorphisms, coverings and cocycles I: equivalence
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/0196-6774(92)90052-eopenalex-snapshot
The NP-completeness column: An ongoing guide
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(94)90251-8openalex-snapshot
On the power of multi-prover interactive protocols
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50011-3openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1016/j.aop.2015.07.021openalex-snapshot
Nonlocality in many-body quantum systems detected with two-body correlators
inferred← citeshttps://doi.org/10.1016/j.apal.2005.06.003openalex-snapshot
What can be efficiently reduced to the Kolmogorov-random strings?
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.ipl.2016.03.008openalex-snapshot
Bounds on 2-query Locally Testable Codes with affine tests
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.004openalex-snapshot
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.006openalex-snapshot
Model-checking hierarchical structures
inferred← citeshttps://doi.org/10.1016/j.measen.2024.101795openalex-snapshot
Evaluating probabilistically checkable proof in software update procedures and functional checks
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.2021.04.001openalex-snapshot
Model independent approach to probabilistic models
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.06.005openalex-snapshot
Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
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/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.1038/s41534-024-00908-8openalex-snapshot
Local testability of distance-balanced quantum codes
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/s0273-0979-06-01143-8openalex-snapshot
On Dinur’s proof of the PCP theorem
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
showing the first 200 of 454 · page through all 454
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.