On the public citation graph
Logics which capture complexity classes over the reals
0 signed · 40 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-60178-3openalex-snapshot
Logic and Computational Complexity
inferredcites →https://doi.org/10.1007/978-1-4612-0701-6openalex-snapshot
Complexity and Real Computation
inferredcites →https://doi.org/10.1016/0304-3975(94)00070-0openalex-snapshot
On the complexity of quadratic programming in real number models of computation
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.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1016/s0747-7171(10)80003-3openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
inferredcites →https://doi.org/10.1016/s0747-7171(10)80004-5openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination
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/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.36045/bbms/1105730626openalex-snapshot
A survey on real structural complexity theory
inferredcites →https://doi.org/10.5860/choice.35-6275copenalex-snapshot
Complexity and real computation
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.200510021openalex-snapshot
Two logical hierarchies of optimization problems over the real numbers
inferred← citeshttps://doi.org/10.1006/jcom.2001.0607openalex-snapshot
Real Computations with Fake Numbers
inferred← citeshttps://doi.org/10.1007/11549345_40openalex-snapshot
Two Logical Hierarchies of Optimization Problems over the Real Numbers
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/3-540-68804-8_3openalex-snapshot
Finite Model Theory and Descriptive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-75775-5_18openalex-snapshot
Tractability Frontiers in Probabilistic Team Semantics and Existential Second-Order Logic over the Reals
inferred← citeshttps://doi.org/10.1007/978-3-030-88853-4_2openalex-snapshot
A Logical Characterization of Constant-Depth Circuits over the Reals
inferred← citeshttps://doi.org/10.1007/978-3-032-33486-2_8openalex-snapshot
A Circuit-Theoretic View of $$\textrm{FO}$$ over Semirings
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_13openalex-snapshot
Periodic Generalized Automata over the Reals
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_20openalex-snapshot
Exotic Quantifiers, Complexity Classes, and Complete Problems
inferred← citeshttps://doi.org/10.1007/s10208-007-9006-9openalex-snapshot
Exotic Quantifiers, Complexity Classes, and Complete Problems
inferred← citeshttps://doi.org/10.1016/j.apal.2022.103108openalex-snapshot
Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
inferred← citeshttps://doi.org/10.1016/j.ic.2005.07.005openalex-snapshot
Implicit complexity over an arbitrary structure: Quantifier alternations
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104452openalex-snapshot
Periodic generalized automata over the reals
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00190-xopenalex-snapshot
Counting problems over the reals
inferred← citeshttps://doi.org/10.1017/s0960129524000136openalex-snapshot
Logical characterizations of algebraic circuit classes over integral domains
inferred← citeshttps://doi.org/10.1090/conm/604/12067openalex-snapshot
Topics in real and complex number complexity theory
inferred← citeshttps://doi.org/10.1093/logcom/exae051openalex-snapshot
A logical characterization of constant-depth circuits over the reals
inferred← citeshttps://doi.org/10.1145/3373718.3394773openalex-snapshot
Descriptive complexity of real computation and probabilistic independence logic
inferred← citeshttps://doi.org/10.3233/fi-2010-235openalex-snapshot
Tree-width in Algebraic 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.