On the public citation graph
Logical Approaches to Computational Barriers: CiE 2006
0 signed · 73 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/0304-3975(94)00069-7openalex-snapshot
Separation of complexity classes in Koiran's weak model
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
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.2178/jsl/1122038912openalex-snapshot
Bounding and nonbounding minimal pairs in the enumeration degrees
inferredcites →https://doi.org/10.2307/2274578openalex-snapshot
1-genericity in the enumeration degrees
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.1007/11780274_24openalex-snapshot
Elementary Algebraic Specifications of the Rational Complex Numbers
inferred← citeshttps://doi.org/10.1007/11780342_24openalex-snapshot
Coinductive Proofs for Basic Real Computation
inferred← citeshttps://doi.org/10.1007/11780342_34openalex-snapshot
Space Bounds for Infinitary Computation
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_17openalex-snapshot
A Survey on Continuous Time Computations
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_16openalex-snapshot
Martin Davis’s Bibliography 1950–2015
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_34openalex-snapshot
An Enhanced Theory of Infinite Time Register Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_36openalex-snapshot
On the Computational Power of Enhanced Mobile Membranes
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_37openalex-snapshot
Recursion in Higher Types and Resource Bounded Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_41openalex-snapshot
Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_45openalex-snapshot
First-Order Model Checking Problems Parameterized by the Model
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_23openalex-snapshot
Satisfiability of Viability Constraints for Pfaffian Dynamics
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_12openalex-snapshot
A Type of Partial Recursive Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_2openalex-snapshot
Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_6openalex-snapshot
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_14openalex-snapshot
K-Trivial Closed Sets and Continuous Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_23openalex-snapshot
Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_25openalex-snapshot
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_73openalex-snapshot
A Useful Undecidable Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_86openalex-snapshot
(Short) Survey of Real Hypercomputation
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_14openalex-snapshot
Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_15openalex-snapshot
Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_31openalex-snapshot
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-89689-0_5openalex-snapshot
Graph Edit Distance without Correspondence from Continuous-Time Quantum Walks
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_12openalex-snapshot
Immunity for Closed Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-03092-5_10openalex-snapshot
Is P = PSPACE for Infinite Time Turing Machines?
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_27openalex-snapshot
On the Complexity of Matroid Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_23openalex-snapshot
Small-Space Analogues of Valiant’s Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_30openalex-snapshot
Focalisation and Classical Realisability
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_17openalex-snapshot
Parallel Reduction in Resource Lambda-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_3openalex-snapshot
A Graph Polynomial Arising from Community Structure (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_25openalex-snapshot
Solvability in Resource Lambda-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_29openalex-snapshot
Undecidability in Weihrauch Degrees
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_31openalex-snapshot
The Lattice Structure of Sets of Surjective Hyper-Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_16openalex-snapshot
Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$
inferred← citeshttps://doi.org/10.1007/978-3-642-21341-0_15openalex-snapshot
Geometrical Accumulations and Computably Enumerable Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-22119-4_12openalex-snapshot
On the Proof Complexity of Cut-Free Bounded Deep Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_22openalex-snapshot
A Short Note on Spector’s Proof of Consistency of Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_41openalex-snapshot
Towards a Theory of Infinite Time Blum-Shub-Smale Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_48openalex-snapshot
Isomorphism for Graphs of Bounded Connected-Path-Distance-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-40537-2_11openalex-snapshot
A Terminating Evaluation-Driven Variant of G3i
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_70openalex-snapshot
QCSP on Semicomplete Digraphs
inferred← citeshttps://doi.org/10.1007/978-88-470-0784-0_8openalex-snapshot
Proofs as Efficient Programs
inferred← citeshttps://doi.org/10.1007/978-90-481-3529-5_8openalex-snapshot
Incomputability, Emergence and the Turing Universe
inferred← citeshttps://doi.org/10.1007/s00153-007-0060-4openalex-snapshot
Algorithmic randomness of continuous functions
inferred← citeshttps://doi.org/10.1007/s00153-007-0063-1openalex-snapshot
The anti-Specker property, a Heine–Borel property, and uniform continuity
inferred← citeshttps://doi.org/10.1007/s00224-007-9024-7openalex-snapshot
Dimension Extractors and Optimal Decompression
inferred← citeshttps://doi.org/10.1007/s00224-007-9035-4openalex-snapshot
Division Safe Calculation in Totalised Fields
inferred← citeshttps://doi.org/10.1007/s00224-012-9416-1openalex-snapshot
Effective Randomness of Unions and Intersections
inferred← citeshttps://doi.org/10.1007/s10472-009-9115-zopenalex-snapshot
From Hilbert’s program to a logic tool box
inferred← citeshttps://doi.org/10.1007/s10472-009-9160-7openalex-snapshot
Spectral schemes as ringed lattices
inferred← citeshttps://doi.org/10.1007/s10817-013-9292-7openalex-snapshot
Using Isabelle/HOL to Verify First-Order Relativity Theory
inferred← citeshttps://doi.org/10.1007/s10849-008-9058-5openalex-snapshot
Partially Ordered Connectives and Monadic Monotone Strict NP
inferred← citeshttps://doi.org/10.1016/j.amc.2007.02.146openalex-snapshot
Computability on reals, infinite limits and differential equations
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.013openalex-snapshot
A foundation for real recursive function theory
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.03.017openalex-snapshot
The enumeration of vertex induced subgraphs with respect to the number of components
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.060openalex-snapshot
Minimality in a Linear Calculus with Iteration
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.02.002openalex-snapshot
Primitive recursive selection functions for existential assertions over abstract algebras
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.015openalex-snapshot
Transfinite machine models
inferred← citeshttps://doi.org/10.1093/logcom/exq006openalex-snapshot
Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas
inferred← citeshttps://doi.org/10.1111/j.1746-8361.2008.01135.xopenalex-snapshot
An Analysis of Gödel's Dialectica Interpretation via Linear Logic
inferred← citeshttps://doi.org/10.1142/s0219061307000652openalex-snapshot
MASS PROBLEMS AND HYPERARITHMETICITY
inferred← citeshttps://doi.org/10.1162/evco.2007.15.2.199openalex-snapshot
Reducing the Number of Fitness Evaluations in Graph Genetic Programming Using a Canonical Graph Indexed Database
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.8openalex-snapshot
A Hardware Relaxation Paradigm for Solving NP-Hard Problems
inferred← citeshttps://doi.org/10.3390/e21060569openalex-snapshot
MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk
inferred← citeshttps://doi.org/10.48550/arxiv.1012.1221openalex-snapshot
Infinite Time Cellular Automata: A Real Computation Model
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.