On the public citation graph

Automata theory meets circuit complexity

https://doi.org/10.1007/bfb0035785
0 signed · 31 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.1007/3-540-18088-5_13openalex-snapshot
Non-uniform automata over groups
inferredcites →https://doi.org/10.1016/0022-4049(88)90097-7openalex-snapshot
Locally trivial categories and unambiguous concatenation
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1016/0196-6774(86)90011-8openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0304-3975(81)90057-8openalex-snapshot
Classification of finite monoids: the language approach
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/b978-0-12-198820-3.50021-8openalex-snapshot
SUBWORD COUNTING AND NILPOTENT GROUPS
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1016/s0065-2458(08)60462-3openalex-snapshot
Information and Computation
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1109/sfcs.1981.35openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1145/12130.12131openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
inferredcites →https://doi.org/10.1145/28395.28404openalex-snapshot
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
inferredcites →https://doi.org/10.1145/28395.28407openalex-snapshot
Finite monoids and the fine structure of NC 1
inferredcites →https://doi.org/10.1145/800061.808733openalex-snapshot
Borel sets and circuit complexity
inferredcites →https://doi.org/10.1145/800061.808736openalex-snapshot
Bounds for width two branching programs

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-36169-3_8openalex-snapshot
On Learning Embedded Midbit Functions
inferred← citeshttps://doi.org/10.1007/bf01212963openalex-snapshot
NC1: The automata-theoretic viewpoint
inferred← citeshttps://doi.org/10.1007/bf01263423openalex-snapshot
On ACC
inferred← citeshttps://doi.org/10.1007/bf02090772openalex-snapshot
Extensions of an idea of McNaughton
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90253-popenalex-snapshot
Extensions to Barrington's M-program model
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90017-vopenalex-snapshot
Oracle branching programs and Logspace versus P
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.013openalex-snapshot
On learning embedded midbit functions
inferred← citeshttps://doi.org/10.1109/sct.1990.113968openalex-snapshot
Extensions to Barrington's M-program model
inferred← citeshttps://doi.org/10.1109/sct.1992.215383openalex-snapshot
Quasipolynomial size circuit classes
inferred← citeshttps://doi.org/10.1109/sct.1995.514863openalex-snapshot
On the structure of low sets [complexity classes]
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185449openalex-snapshot
On ACC (circuit complexity)
inferred← citeshttps://doi.org/10.1137/s0097539792233907openalex-snapshot
A Uniform Circuit Lower Bound for the Permanent
inferred← citeshttps://doi.org/10.70675/412a4333z5867z452fz9404z271549351d1dopenalex-snapshot
The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids
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.