On the public citation graph

The Spectra of First-Order Sentences and Computational Complexity

https://doi.org/10.1137/0213025
0 signed · 35 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.1002/malq.19750210117openalex-snapshot
A spectrum hierarchy
inferredcites →https://doi.org/10.1007/bf01705890openalex-snapshot
Quasi-realtime languages
inferredcites →https://doi.org/10.1007/bf01786976openalex-snapshot
Complexity classes and theories of finite models
inferredcites →https://doi.org/10.1016/0022-0000(80)90027-6openalex-snapshot
Complexity results for classes of quantificational formulas
inferredcites →https://doi.org/10.1016/0022-0000(81)90039-8openalex-snapshot
Number of quantifiers is better than number of tape cells
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/s0022-0000(73)80028-5openalex-snapshot
A hierarchy for nondeterministic time complexity
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1137/0204018openalex-snapshot
Every Prime Has a Succinct Certificate
inferredcites →https://doi.org/10.1145/322047.322061openalex-snapshot
Separating Nondeterministic Time Complexity Classes
inferredcites →https://doi.org/10.2307/2272354openalex-snapshot
Turing machines and the spectra of first-order formulas

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-16486-3_102openalex-snapshot
A depth-size tradeoff for boolean circuits with unbounded fan-in
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_164openalex-snapshot
First-order spectra with one variable
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_38openalex-snapshot
On logical descriptions of some concepts in structural complexity theory
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_106openalex-snapshot
Computing on structures
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_34openalex-snapshot
On bijections vs. unary functions
inferred← citeshttps://doi.org/10.1007/bf01276438openalex-snapshot
The quantifier structure of sentences that characterize nondeterministic time complexity
inferred← citeshttps://doi.org/10.1007/bf01699468openalex-snapshot
Universal quantifiers and time complexity of random access machines
inferred← citeshttps://doi.org/10.1007/bfb0022255openalex-snapshot
First-order spectra with one binary predicate
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90009-aopenalex-snapshot
First-order spectra with one variable
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90227-sopenalex-snapshot
On Horn spectra
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00112-3openalex-snapshot
First-order spectra with one binary predicate
inferred← citeshttps://doi.org/10.1016/b978-044450944-4/50010-4openalex-snapshot
Modeling Complexity for Interactive Art Works on the Internet
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.09.002openalex-snapshot
Graph properties checkable in linear time in the number of vertices
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70326-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1109/sct.1990.113969openalex-snapshot
The quantifier structure of sentences that characterize nondeterministic time complexity
inferred← citeshttps://doi.org/10.1109/sct.1992.215391openalex-snapshot
Fixpoint logics, relational machines, and computational complexity
inferred← citeshttps://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferred← citeshttps://doi.org/10.1137/0217050openalex-snapshot
A Natural NP-Complete Problem with a Nontrivial Lower Bound
inferred← citeshttps://doi.org/10.1137/0219028openalex-snapshot
A Nontrivial Lower Bound for an NP Problem on Automata
inferred← citeshttps://doi.org/10.1137/130943625openalex-snapshot
Regular Graphs and the Spectra of Two-Variable Logic with Counting
inferred← citeshttps://doi.org/10.1137/s0097539795285102openalex-snapshot
Weighted NP Optimization Problems: Logical Definability and Approximation Properties
inferred← citeshttps://doi.org/10.1145/256292.256295openalex-snapshot
Fixpoint logics, relational machines, and computational complexity
inferred← citeshttps://doi.org/10.1145/2733376openalex-snapshot
On the Variable Hierarchy of First-Order Spectra
inferred← citeshttps://doi.org/10.2178/bsl.1804020openalex-snapshot
Fifty years of the spectrum problem: survey and new results
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.