On the public citation graph
On self-transformable combinatorial problems
0 signed · 38 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-08860-1_6openalex-snapshot
Relationship between density and deterministic complexity of MP-complete languages
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-23929-8_2openalex-snapshot
Algorithms and Complexity
inferredcites →https://doi.org/10.1007/bf00265223openalex-snapshot
The network complexity and the Turing machine complexity of finite functions
inferredcites →https://doi.org/10.1016/0020-0190(76)90097-1openalex-snapshot
Relative complexity of checking and evaluating
inferredcites →https://doi.org/10.1016/0304-3975(76)90070-0openalex-snapshot
Fourth international colloquium on automata, languages and programming
inferredcites →https://doi.org/10.1109/sfcs.1978.37openalex-snapshot
Two theorems on random polynomial time
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1145/322047.322060openalex-snapshot
Satisfiability Is Quasilinear Complete in NQL
inferredcites →https://doi.org/10.1145/800116.803773openalex-snapshot
Riemann's Hypothesis and tests for primality
inferredcites →https://doi.org/10.1145/800119.803893openalex-snapshot
On the lengths of proofs in the propositional calculus (Preliminary Version)
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.1006/inco.1996.0097openalex-snapshot
A Note on Decision versus Search for Graph Automorphism
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_68openalex-snapshot
On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_3openalex-snapshot
Foundations of Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_8openalex-snapshot
Other Public-Key Cryptosystems and Protocols
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_22openalex-snapshot
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_82openalex-snapshot
Padding, commitment and self-reducibility
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_6openalex-snapshot
Self-Reducibility: Effects of Internal Structure on Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_4openalex-snapshot
Strong Backdoors for Default Logic
inferred← citeshttps://doi.org/10.1007/978-981-96-4448-3_14openalex-snapshot
Fair Selection of Clearing Schemes for Kidney Exchange Markets
inferred← citeshttps://doi.org/10.1007/bf01293484openalex-snapshot
Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
inferred← citeshttps://doi.org/10.1007/bfb0028559openalex-snapshot
The complexity of modular graph automorphism
inferred← citeshttps://doi.org/10.1007/s00224-001-1048-9openalex-snapshot
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90125-4openalex-snapshot
On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.001openalex-snapshot
Backdoors to tractable answer set programming
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.04.007openalex-snapshot
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
inferred← citeshttps://doi.org/10.1080/00987913.1992.10764089openalex-snapshot
Revista Matematica De La Universidad Complutense De Madrid
inferred← citeshttps://doi.org/10.1109/ccc.1996.507689openalex-snapshot
A note on decision versus search for graph automorphism
inferred← citeshttps://doi.org/10.1109/sct.1989.41833openalex-snapshot
Nondeterministic witnesses and nonuniform advice
inferred← citeshttps://doi.org/10.1137/s0097539799358227openalex-snapshot
The Complexity of Modular Graph Automorphism
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0106045openalex-snapshot
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs
inferred← citeshttps://doi.org/10.5209/rev_rema.1989.v2.n2.18114openalex-snapshot
Self-reducibility structures and solutions of NP problemst
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.