On the public citation graph
On Digital Nondeterminism
0 signed · 48 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/978-3-642-82657-3openalex-snapshot
Disordered Systems and Biological Organization
inferredcites →https://doi.org/10.1007/bf00339943openalex-snapshot
“Neural” computation of decisions in optimization problems
inferredcites →https://doi.org/10.1016/0022-0000(79)90054-0openalex-snapshot
On the complexity of computations under varying sets of primitives
inferredcites →https://doi.org/10.1016/0304-3975(76)90068-2openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1016/0304-3975(94)90178-3openalex-snapshot
Analog computation via neural networks
inferredcites →https://doi.org/10.1016/0885-064x(92)90007-xopenalex-snapshot
A note on a P ≠ NP result for a restricted class of real machines
inferredcites →https://doi.org/10.1016/0885-064x(92)90008-yopenalex-snapshot
Two P-complete problems in the theory of the reals
inferredcites →https://doi.org/10.1073/pnas.79.8.2554openalex-snapshot
Neural networks and physical systems with emergent collective computational abilities.
inferredcites →https://doi.org/10.1090/s0273-0979-1989-15750-9openalex-snapshot
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
inferredcites →https://doi.org/10.1093/comjnl/36.5.400openalex-snapshot
On the Complexity of Quantifier Elimination: the Structural Approach
inferredcites →https://doi.org/10.1137/s0097539793256041openalex-snapshot
Bounds for the Computational Power and Learning Complexity of Analog Neural Nets
inferredcites →https://doi.org/10.1146/annurev.cs.03.060188.001533openalex-snapshot
Algebraic Complexity Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19980440102openalex-snapshot
Computability of String Functions Over Algebraic Structures Armin Hemmerling
inferred← citeshttps://doi.org/10.1002/malq.200310020openalex-snapshot
P ≠ NP for all infinite Boolean algebras
inferred← citeshttps://doi.org/10.1006/jcom.1997.0444openalex-snapshot
On NP-Completeness for Linear Machines
inferred← citeshttps://doi.org/10.1006/jcom.2001.0583openalex-snapshot
The P-DNP Problem for Infinite Abelian Groups
inferred← citeshttps://doi.org/10.1007/11537311_42openalex-snapshot
The Complexity of Semilinear Problems in Succinct Representation
inferred← citeshttps://doi.org/10.1007/11558958_19openalex-snapshot
On the Approximation of Interval Functions
inferred← citeshttps://doi.org/10.1007/11839132_8openalex-snapshot
Approximation Classes for Real Number Optimization Problems
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_2openalex-snapshot
Query Languages for Real Number Databases Based on Descriptive Complexity over R
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_1openalex-snapshot
Computational Complexity of Multi-player Evolutionarily Stable Strategies
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_5openalex-snapshot
The Existential Theory of the Reals as a Complexity Class: A Compendium
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_19openalex-snapshot
On the height used by additives BSS machines
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_22openalex-snapshot
Dynamical Recognizers: Real-time Language Recognition by Analog Computers (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-662-04166-6_68openalex-snapshot
Polynomials of Bounded Tree Width (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/bfb0036180openalex-snapshot
Logics which capture complexity classes over the reals
inferred← citeshttps://doi.org/10.1007/s10208-007-9006-9openalex-snapshot
Exotic Quantifiers, Complexity Classes, and Complete Problems
inferred← citeshttps://doi.org/10.1007/s10208-014-9188-xopenalex-snapshot
The PCP Theorem for NP Over the Reals
inferred← citeshttps://doi.org/10.1016/0304-3975(93)00063-bopenalex-snapshot
Computing over the reals with addition and order
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00069-7openalex-snapshot
Separation of complexity classes in Koiran's weak model
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00070-0openalex-snapshot
On the complexity of quadratic programming in real number models of computation
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00002-3openalex-snapshot
Generalized Knapsack problems and fixed degree separations
inferred← citeshttps://doi.org/10.1016/j.jco.2007.02.005openalex-snapshot
A note on parallel and alternating time
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.11.022openalex-snapshot
On the P–NP problem over real matrix rings
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00028-5openalex-snapshot
Dynamical recognizers: real-time language recognition by analog computers
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00269-2openalex-snapshot
Some aspects of studying an optimization or decision problem in different computational models
inferred← citeshttps://doi.org/10.1023/b:reom.0000032109.55408.1aopenalex-snapshot
On a Refined Analysis of Some Problems in Interval Arithmetic Using Real Number Complexity Theory
inferred← citeshttps://doi.org/10.1080/02331930701779013openalex-snapshot
Complexity aspects of a semi-infinite optimization problem†
inferred← citeshttps://doi.org/10.1093/logcom/exm031openalex-snapshot
Logical Approaches to Computational Barriers: CiE 2006
inferred← citeshttps://doi.org/10.1109/dynamics.2016.7819075openalex-snapshot
On the P vs NP problem over reals with integer oracle
inferred← citeshttps://doi.org/10.1134/s0965542523010116openalex-snapshot
Generalization of the Subset Sum Problem and Cubic Forms
inferred← citeshttps://doi.org/10.1137/s0097539702415950openalex-snapshot
Counting Complexity Classes for Numeric Computations I: Semilinear Sets
inferred← citeshttps://doi.org/10.1145/248210.248223openalex-snapshot
A graph-constructive approach to solving systems of geometric constraints
inferred← citeshttps://doi.org/10.2307/2586770openalex-snapshot
Logics which capture complexity classes over the reals
inferred← citeshttps://doi.org/10.31857/s0044466923010118openalex-snapshot
Generalization of the Subset Sum Problem and Cubic Forms
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.