On the public citation graph
The equivalence of Horn and network complexity for Boolean functions
0 signed · 22 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/978-3-322-94701-7openalex-snapshot
Rekursive Funktionen und ihre Komplexität
inferredcites →https://doi.org/10.1007/bf00265223openalex-snapshot
The network complexity and the Turing machine complexity of finite functions
inferredcites →https://doi.org/10.1007/bf02025119openalex-snapshot
Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
inferredcites →https://doi.org/10.1016/0304-3975(76)90068-2openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1016/s0049-237x(08)70839-5openalex-snapshot
On the Decision Problem for Formulas in which all Disjunctions are Binary
inferredcites →https://doi.org/10.1016/s0049-237x(09)70441-0openalex-snapshot
The Network Complexity and the Breadth of Boolean Functions
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
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-10854-8_45openalex-snapshot
Logical description of computation processes
inferred← citeshttps://doi.org/10.1007/3-540-13331-3_50openalex-snapshot
Spektralproblem and completeness of logical decision problems
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_36openalex-snapshot
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_20openalex-snapshot
Transformations into Normal Forms for Quantified Circuits
inferred← citeshttps://doi.org/10.1007/978-94-011-2496-6_3openalex-snapshot
Complexity of Logical Decision Problems: An Introduction
inferred← citeshttps://doi.org/10.1007/bfb0020821openalex-snapshot
The expressive power of second order Horn logic
inferred← citeshttps://doi.org/10.1007/bfb0028787openalex-snapshot
On some "non-uniform" complexity measures
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.artint.2015.09.003openalex-snapshot
Learning Boolean specifications
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80026-7openalex-snapshot
Uniform characterizations of non-uniform complexity measures
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71820-2openalex-snapshot
Decision Problems in Predicate Logic
inferred← citeshttps://doi.org/10.1162/00240940252940531openalex-snapshot
Modeling the Emergence of Complexity: Complex Systems, the Origin of Life and Interactive On-Line Art
inferred← citeshttps://doi.org/10.1305/ndjfl/1093638014openalex-snapshot
On the existence of polynomial time algorithms for interpolation problems in propositional logic.
inferred← citeshttps://doi.org/10.7238/a.v0i9.778openalex-snapshot
Life Spacies and Life Spacies II: modelling complex systems for interactive art
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.