On the public citation graph

Accessible telephone directories

0 signed · 34 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.1017/s0022481200028383openalex-snapshot
Des belles paires aux beaux uples
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

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.1995.1018openalex-snapshot
Computing over the Reals with Addition and Order: Higher Complexity Classes
inferred← citeshttps://doi.org/10.1006/jcom.1997.0433openalex-snapshot
Elimination of Constants from Machines over Algebraically Closed Fields
inferred← citeshttps://doi.org/10.1006/jcom.1999.0537openalex-snapshot
A Note on Non-complete Problems in NPR
inferred← citeshttps://doi.org/10.1006/jcss.1997.1478openalex-snapshot
A Weak Version of the Blum, Shub, and Smale Model
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_12openalex-snapshot
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_4openalex-snapshot
Une tentative malheureuse de construire une structure éliminant rapidement les quanteurs
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_3openalex-snapshot
Circuits versus Trees in Algebraic Complexity
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-540-74456-6_64openalex-snapshot
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
inferred← citeshttps://doi.org/10.1007/bf01301968openalex-snapshot
On Digital Nondeterminism
inferred← citeshttps://doi.org/10.1007/s10208-009-9048-2openalex-snapshot
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00067-0openalex-snapshot
P≠NP over the nonstandard reals implies P≠NP over R
inferred← citeshttps://doi.org/10.1016/j.jco.2004.09.005openalex-snapshot
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
inferred← citeshttps://doi.org/10.1016/j.jco.2005.02.001openalex-snapshot
P=NP for some structures over the binary words
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00060-8openalex-snapshot
Saturation and stability in the theory of computation over the reals
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00364-9openalex-snapshot
Calculs sur les structures de langage dénombrable
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00029-7openalex-snapshot
Résolutions universelles pour des problèmes NP-complets
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.1016/s1571-0661(03)00005-7openalex-snapshot
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH
inferred← citeshttps://doi.org/10.1093/logcom/exh036openalex-snapshot
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366838openalex-snapshot
A weak version of the Blum, Shub and Smale model
inferred← citeshttps://doi.org/10.1137/s0097539794270340openalex-snapshot
On the Power of Real Turing Machines over Binary Inputs
inferred← citeshttps://doi.org/10.1145/2603088.2603159openalex-snapshot
On the computing power of +, -, and ×
inferred← citeshttps://doi.org/10.1145/276698.276864openalex-snapshot
Are lower bounds easier over the reals?
inferred← citeshttps://doi.org/10.1145/2869073openalex-snapshot
Computational Complexity of Quantum Satisfiability
inferred← citeshttps://doi.org/10.2178/jsl/1230396913openalex-snapshot
A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant
inferred← citeshttps://doi.org/10.2307/2586502openalex-snapshot
Stabilité polynômiale des corps différentiels
inferred← citeshttps://doi.org/10.36045/bbms/1105730626openalex-snapshot
A survey on real structural complexity theory
inferred← citeshttps://doi.org/10.4153/s0008414x21000560openalex-snapshot
Algorithms yield upper bounds in differential algebra
inferred← citeshttps://doi.org/10.48550/arxiv.1401.4879openalex-snapshot
On the Computing Power of $+$, $-$, and $\times$
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.