On the public citation graph

The complexity of the max word problem and the power of one-way interactive proof systems

https://doi.org/10.1007/bf01271372
0 signed · 50 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.
Claim with ORCID
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.
See reference health

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_28openalex-snapshot
The ring of k-regular sequences
inferredcites →https://doi.org/10.1007/978-1-4612-6264-0openalex-snapshot
Automata-Theoretic Aspects of Formal Power Series
inferredcites →https://doi.org/10.1007/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bf01200430openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bfb0020820openalex-snapshot
The complexity of the max word problem
inferredcites →https://doi.org/10.1016/c2013-0-11297-4openalex-snapshot
Introduction to Probabilistic Automata
inferredcites →https://doi.org/10.1016/s0019-9958(63)90290-0openalex-snapshot
Probabilistic automata
inferredcites →https://doi.org/10.1109/fscs.1990.89518openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1109/sct.1992.215403openalex-snapshot
Interactive proof systems with polynomially bounded strategies
inferredcites →https://doi.org/10.1109/sfcs.1989.63519openalex-snapshot
On the complexity of space bounded interactive proofs
inferredcites →https://doi.org/10.1109/sfcs.1991.185341openalex-snapshot
Approximating clique is almost NP-complete
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
inferredcites →https://doi.org/10.1145/103516.128681openalex-snapshot
Space-bounded probabilistic game automata
inferredcites →https://doi.org/10.1145/22145.22178openalex-snapshot
The knowledge complexity of interactive proof-systems
inferredcites →https://doi.org/10.1145/22145.22192openalex-snapshot
Trading group theory for randomness
inferredcites →https://doi.org/10.1145/322017.322031openalex-snapshot
Word Problems Solvable in Logspace
inferredcites →https://doi.org/10.2307/2315515openalex-snapshot
The Theory of Groups: An Introduction.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118032916.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118595091.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9781118600207.ch13openalex-snapshot
Inapproximability of Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1002/9781119005353.biblioopenalex-snapshot
General Bibliography
inferred← citeshttps://doi.org/10.1002/9781119005353.ch13openalex-snapshot
Inapproximability of Combinatorial Optimization Problems
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.1007/0-387-22444-0_7openalex-snapshot
Approximability of NP-Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-032-15641-9_7openalex-snapshot
Short and Useful Quantum Proofs for Sublogarithmic-Space Verifiers
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-642-30870-3_65openalex-snapshot
Finite State Verifiers with Constant Randomness
inferred← citeshttps://doi.org/10.1007/bf01585569openalex-snapshot
The complexity of approximating a nonlinear program
inferred← citeshttps://doi.org/10.1007/s00224-014-9547-7openalex-snapshot
The Complexity of Debate Checking
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104744openalex-snapshot
Constant-space, constant-randomness verifiers with arbitrarily small error
inferred← citeshttps://doi.org/10.1090/psapm/050/1368642openalex-snapshot
The use of coding theory in computational complexity
inferred← citeshttps://doi.org/10.1109/focs.2011.62openalex-snapshot
A Two Prover One Round Game with Strong Soundness
inferred← citeshttps://doi.org/10.1109/istcs.1993.253462openalex-snapshot
Interactive proofs and approximation: reductions from two provers in one round
inferred← citeshttps://doi.org/10.1109/sct.1992.215403openalex-snapshot
Interactive proof systems with polynomially bounded strategies
inferred← citeshttps://doi.org/10.1109/sct.1995.514724openalex-snapshot
Weighted NP optimization problems: logical definability and approximation properties
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267824openalex-snapshot
Probabilistic checking of proofs; a new characterization of NP
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366815openalex-snapshot
The hardness of approximate optima in lattices, codes, and systems of linear equations
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492573openalex-snapshot
Free bits, PCPs and non-approximability-towards tight results
inferred← citeshttps://doi.org/10.1137/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
inferred← citeshttps://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferred← citeshttps://doi.org/10.1145/276698.276784openalex-snapshot
The approximability of NP-hard problems
inferred← citeshttps://doi.org/10.2168/lmcs-10(3:6)2014openalex-snapshot
Finite state verifiers with constant randomness
inferred← citeshttps://doi.org/10.4086/cjtcs.1995.004openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2013.v009a028openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1209.5192openalex-snapshot
Probabilistic verifiers for asymmetric debates
inferred← citeshttps://doi.org/10.48550/arxiv.1211.7346openalex-snapshot
Checking generalized debates with small space and randomness
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0304038openalex-snapshot
How NP got a new definition: a survey of probabilistically checkable proofs
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.