On the public citation graph
A logical approach to the problem “P=NP?”
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.1016/s0049-237x(09)70359-3openalex-snapshot
Formalization of Some Notions in Terms of Computational Complexity
inferredcites →https://doi.org/10.1109/sfcs.1978.23openalex-snapshot
Model theoretic aspects of computational complexity
inferredcites →https://doi.org/10.1145/1008335.1008336openalex-snapshot
Independence results in computer science
inferredcites →https://doi.org/10.1145/800116.803756openalex-snapshot
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
inferredcites →https://doi.org/10.1145/800135.804411openalex-snapshot
A programming language theorem which is independent of Peano Arithmetic
inferredcites →https://doi.org/10.1145/800152.804909openalex-snapshot
Turing machines and the spectra of first-order formulas with equality
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.21236/ada071719openalex-snapshot
Some Connection Between Mathematical Logic and Complexity Theory,
inferredcites →https://doi.org/10.2307/2269958openalex-snapshot
Existence and feasibility in arithmetic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_116openalex-snapshot
On existence of complete predicate calculus in metamathematics without exponentiation
inferred← citeshttps://doi.org/10.1007/3-540-17187-8_27openalex-snapshot
Logic programming and parallel complexity
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_84openalex-snapshot
Bounded set theory and polynomial computability
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_11openalex-snapshot
Δ-Languages for sets and sub-PTIME graph transformers
inferred← citeshttps://doi.org/10.1007/978-1-4612-3466-1_3openalex-snapshot
On Model Theory for Intuitionistic Bounded Arithmetic with Applications to Independence Results
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_25openalex-snapshot
An Equivalence between Polynomial Constructivity of Markov’s Principle and the Equality P=NP
inferred← citeshttps://doi.org/10.1007/978-3-319-24756-4_11openalex-snapshot
Constructive Mathematics in St. Petersburg, Russia: A (Somewhat Subjective) View from Within
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_26openalex-snapshot
Mathematical Logic in the Former Soviet Union: Brief History and Current Trends
inferred← citeshttps://doi.org/10.1007/bfb0099491openalex-snapshot
Abstract recursion as a foundation for the theory of algorithms
inferred← citeshttps://doi.org/10.1007/s13373-011-0008-1openalex-snapshot
Asymptotic invariants, complexity of groups and related problems
inferred← citeshttps://doi.org/10.1016/0020-0255(84)90036-7openalex-snapshot
“NP = P?” and restricted partitions
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90345-topenalex-snapshot
Hereditarily-finite sets, data bases and polynomial-time computability
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50022-6openalex-snapshot
Elements of Relational Database Theory
inferred← citeshttps://doi.org/10.1016/j.amc.2006.12.012openalex-snapshot
On the metamathematics of the P vs. NP question
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00030-xopenalex-snapshot
Bounded arithmetic, proof complexity and two papers of Parikh
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00174-0openalex-snapshot
Δ-languages for sets and LOGSPACE computable graph transformers
inferred← citeshttps://doi.org/10.1023/a:1005934721802openalex-snapshot
Proof Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification
inferred← citeshttps://doi.org/10.1023/a:1023260415982openalex-snapshot
Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification
inferred← citeshttps://doi.org/10.1109/fuzzy.1995.409970openalex-snapshot
When is an algorithm feasible? Soft computing approach
inferred← citeshttps://doi.org/10.1109/mahc.1984.10036openalex-snapshot
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
inferred← citeshttps://doi.org/10.1109/sct.1992.215391openalex-snapshot
Fixpoint logics, relational machines, and computational complexity
inferred← citeshttps://doi.org/10.1145/129712.129771openalex-snapshot
The history and status of the P versus NP question
inferred← citeshttps://doi.org/10.1145/256292.256295openalex-snapshot
Fixpoint logics, relational machines, and computational complexity
inferred← citeshttps://doi.org/10.1145/800057.808707openalex-snapshot
Uniform definability on finite structures with successor
inferred← citeshttps://doi.org/10.48550/arxiv.physics/0105038openalex-snapshot
Ideas Behind Kolmogorov Complexity and Related Kolmogorov's Ideas about The Physical Impossibility of Large Integers: How Their Formalization Can Help in Foundations of Physics
inferred← citeshttps://doi.org/10.5120/ijca2019919465openalex-snapshot
P vs NP Solution – Advances in Computational Complexity, Status and Future Scope
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.