On the public citation graph
Tailoring recursion for complexity
0 signed · 33 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.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/bf00299636openalex-snapshot
The method of forced enumeration for nondeterministic automata
inferredcites →https://doi.org/10.1007/bfb0099486openalex-snapshot
Toward logic tailored for computational complexity
inferredcites →https://doi.org/10.1016/0022-0000(82)90011-3openalex-snapshot
Upper and lower bounds for first order expressibility
inferredcites →https://doi.org/10.1016/0022-0000(88)90039-6openalex-snapshot
The complexity of optimization problems
inferredcites →https://doi.org/10.1016/0022-0000(91)90032-zopenalex-snapshot
Datalog extensions for database queries and updates
inferredcites →https://doi.org/10.1016/0168-0072(86)90055-2openalex-snapshot
Fixed-point extensions of first-order logic
inferredcites →https://doi.org/10.1016/0304-3975(92)90149-aopenalex-snapshot
Capturing complexity classes by fragments of second-order logic
inferredcites →https://doi.org/10.1016/0890-5401(90)90063-nopenalex-snapshot
An algebra and a logic for NC1
inferredcites →https://doi.org/10.1016/s0019-9958(84)80062-5openalex-snapshot
A logic for constant-depth circuits
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1090/psapm/038/1020810openalex-snapshot
Descriptive and computational complexity
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation
inferredcites →https://doi.org/10.2307/2183047openalex-snapshot
Logic, Methodology and Philosophy of Science.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_32openalex-snapshot
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures
inferred← citeshttps://doi.org/10.1007/11784180_8openalex-snapshot
Some Programming Languages for Logspace and Ptime
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_12openalex-snapshot
Quasi-interpretations and Small Space Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_1openalex-snapshot
Yuri, Logic, and Computer Science
inferred← citeshttps://doi.org/10.1007/978-3-662-21676-7openalex-snapshot
Bounded Variable Logics and Counting
inferred← citeshttps://doi.org/10.1007/bfb0023481openalex-snapshot
Algebraic and logical characterizations of deterministic linear time classes
inferred← citeshttps://doi.org/10.1007/bfb0036180openalex-snapshot
Logics which capture complexity classes over the reals
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.034openalex-snapshot
Intensional Properties of Polygraphs
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.1017/s0956796800003877openalex-snapshot
Algorithms with polynomial interpretation termination proof
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/lics.1996.561337openalex-snapshot
On the expressive power of simply typed and let-polymorphic lambda calculi
inferred← citeshttps://doi.org/10.1137/s0097539799360240openalex-snapshot
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
inferred← citeshttps://doi.org/10.1145/2764906openalex-snapshot
Computational Complexity Via Finite Types
inferred← citeshttps://doi.org/10.2307/2586770openalex-snapshot
Logics which capture complexity classes over the reals
inferred← citeshttps://doi.org/10.4204/eptcs.23.2openalex-snapshot
Observation of implicit complexity by non confluence
inferred← citeshttps://doi.org/10.48550/arxiv.1502.01257openalex-snapshot
Towards a Complexity-through-Realisability Theory
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.