On the public citation graph

The complexity of the max word problem

https://doi.org/10.1007/bfb0020820
0 signed · 22 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.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/sct.1988.5276openalex-snapshot
Space bounded probabilistic game automata
inferredcites →https://doi.org/10.1109/sfcs.1989.63519openalex-snapshot
On the complexity of space bounded interactive proofs
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
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/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.1007/0-387-23830-1_3openalex-snapshot
Probabilistic Verification and Non-Approximability
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/bfb0015408openalex-snapshot
Logspace verifiers, NC, and NP
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00158-1openalex-snapshot
On the complexity of partially observed Markov decision processes
inferred← citeshttps://doi.org/10.1016/s0304-0208(04)80009-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185341openalex-snapshot
Approximating clique is almost NP-complete
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267824openalex-snapshot
Probabilistic checking of proofs; a new characterization of NP
inferred← citeshttps://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferred← citeshttps://doi.org/10.1145/167088.167172openalex-snapshot
On the hardness of approximating minimization problems
inferred← citeshttps://doi.org/10.1145/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferred← citeshttps://doi.org/10.48550/arxiv.1206.2436openalex-snapshot
A Proof Checking View of Parameterized Complexity
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.