On the public citation graph
The network complexity and the Turing machine complexity of finite functions
0 signed · 98 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.1145/321356.321362openalex-snapshot
Two-Tape Simulation of Multitape Turing Machines
inferredcites →https://doi.org/10.1145/321724.321731openalex-snapshot
Computational Work and Time on Finite Machines
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-07407-4_10openalex-snapshot
The network-complexity of equivalence and other applications of the network complexity
inferred← citeshttps://doi.org/10.1007/3-540-07407-4_9openalex-snapshot
The complexity of negation-limited networks — A brief survey
inferred← citeshttps://doi.org/10.1007/3-540-07805-3_11openalex-snapshot
X. Simulation von Turingmaschinen mit logischen Netzen
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_31openalex-snapshot
Über Netzwerkgrössen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten operationen
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_124openalex-snapshot
Degrees of Circuit Complexity
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_24openalex-snapshot
A graph theoretic approach to determinism versus non-determinism
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_134openalex-snapshot
Quasilinear time complexity theory
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_157openalex-snapshot
On the power of nonconservative PRAM
inferred← citeshttps://doi.org/10.1007/bf00289238openalex-snapshot
Characterization of all optimal networks for a simultaneous computation of AND and NOR
inferred← citeshttps://doi.org/10.1007/bf00289267openalex-snapshot
The equivalence of Horn and network complexity for Boolean functions
inferred← citeshttps://doi.org/10.1007/bf00670329openalex-snapshot
Uncontrollable computational growth in theoretical physics
inferred← citeshttps://doi.org/10.1007/bf02023010openalex-snapshot
A lower bound for the complexity of Craig's interpolants in sentential logic
inferred← citeshttps://doi.org/10.1007/bfb0012799openalex-snapshot
Efficient simulations of multicounter machines
inferred← citeshttps://doi.org/10.1007/bfb0120931openalex-snapshot
On self-transformable combinatorial problems
inferred← citeshttps://doi.org/10.1007/s10458-013-9224-2openalex-snapshot
Computational complexity and approximability of social welfare optimization in multiagent resource allocation
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90038-6openalex-snapshot
On uniform circuit complexity
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90044-xopenalex-snapshot
Parallel algorithms for solvable permutation groups
inferred← citeshttps://doi.org/10.1016/0166-218x(82)90029-4openalex-snapshot
Compositional complexity of Boolean functions
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90018-6openalex-snapshot
Problems complete for deterministic logarithmic space
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90083-9openalex-snapshot
A lower bound on the number of additions in monotone computations
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90074-2openalex-snapshot
A 3n-lower bound on the network complexity of Boolean functions
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90074-8openalex-snapshot
On the complexity of 2-output Boolean networks
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90017-9openalex-snapshot
Complete divisibility problems for slowly utilized oracles
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90036-2openalex-snapshot
Complex boolean networks obtained by diagonalization
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90151-5openalex-snapshot
A survey of space complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00031-qopenalex-snapshot
On quasilinear-time complexity theory
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90009-6openalex-snapshot
Complexity theory of parallel time and hardware
inferred← citeshttps://doi.org/10.1016/b978-0-12-389450-2.50014-1openalex-snapshot
Time and Space††This research was supported in part under N S F grant GJ 43634X, contract number DCR 7412997 A01.
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50006-0openalex-snapshot
Machine Models and Simulations
inferred← citeshttps://doi.org/10.1016/j.artint.2004.04.002openalex-snapshot
On the computational complexity of qualitative coalitional games
inferred← citeshttps://doi.org/10.1016/j.artint.2005.01.006openalex-snapshot
The complexity of contract negotiation
inferred← citeshttps://doi.org/10.1016/j.ic.2014.04.001openalex-snapshot
Oblivious two-way finite automata: Decidability and complexity
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.06.008openalex-snapshot
The complexity of depth-3 circuits computing symmetric Boolean functions
inferred← citeshttps://doi.org/10.1016/j.physd.2022.133585openalex-snapshot
PAC-learning gains of Turing machines over circuits and neural networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.031openalex-snapshot
The complexity of deciding reachability properties of distributed negotiation schemes
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.024openalex-snapshot
Complexity of multi-head finite automata: Origins and directions
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90363-1openalex-snapshot
On efficient simulations of multicounter machines
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71822-6openalex-snapshot
NP and Craig's Interpolation Theorem
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70440-9openalex-snapshot
Bounded Concatenation Theory as a Uniform Method for Proving Lower Complexity Bounds
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70441-0openalex-snapshot
The Network Complexity and the Breadth of Boolean Functions
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00237-7openalex-snapshot
Multi-head finite automata: data-independent versus data-dependent computations
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00054-9openalex-snapshot
On the simulation of quantum turing machines
inferred← citeshttps://doi.org/10.1017/s0140525x00016678openalex-snapshot
How are grammers represented?
inferred← citeshttps://doi.org/10.1017/s0140525x0001668xopenalex-snapshot
Using what you know: A computer-science perspective
inferred← citeshttps://doi.org/10.1017/s0140525x00016691openalex-snapshot
On a computational perspective without substance
inferred← citeshttps://doi.org/10.1017/s0140525x00016708openalex-snapshot
Church's thesis and representation of grammars
inferred← citeshttps://doi.org/10.1017/s0140525x0001671xopenalex-snapshot
On the hypothesis that grammars are mentally represented
inferred← citeshttps://doi.org/10.1017/s0140525x00016721openalex-snapshot
When do representations explain?
inferred← citeshttps://doi.org/10.1017/s0140525x00016733openalex-snapshot
A few analogies with computing
inferred← citeshttps://doi.org/10.1017/s0140525x00016745openalex-snapshot
Internally represented grammars
inferred← citeshttps://doi.org/10.1017/s0140525x00016757openalex-snapshot
Computational commitment and physical realization
inferred← citeshttps://doi.org/10.1017/s0140525x00016769openalex-snapshot
Levels of grammatic representation: A tempest in a teapot
inferred← citeshttps://doi.org/10.1017/s0140525x00016770openalex-snapshot
On speculating across opaque barriers
inferred← citeshttps://doi.org/10.1017/s0140525x00016782openalex-snapshot
Execute criminals, not rules of grammer
inferred← citeshttps://doi.org/10.1017/s0140525x00016794openalex-snapshot
Word processor or video game?
inferred← citeshttps://doi.org/10.1017/s0140525x00016812openalex-snapshot
The relevance of the machine metaphor
inferred← citeshttps://doi.org/10.1017/s0140525x00016824openalex-snapshot
Grammars-as-programs versus grammars- as-data
inferred← citeshttps://doi.org/10.1017/s0140525x00016836openalex-snapshot
Computation misrepresented: The procedural/declarative controversy exhumed
inferred← citeshttps://doi.org/10.1017/s0140525x0001685xopenalex-snapshot
Computational theories and mental representation
inferred← citeshttps://doi.org/10.1017/s0140525x00073763openalex-snapshot
How could you tell how grammars are represented?
inferred← citeshttps://doi.org/10.1023/a:1022941621273openalex-snapshot
Explanation by Computer Simulation in Cognitive Science
inferred← citeshttps://doi.org/10.1038/s41534-019-0156-9openalex-snapshot
The computational landscape of general physical theories
inferred← citeshttps://doi.org/10.1051/ita/1979130100871openalex-snapshot
Combined complexity classes for finite functions
inferred← citeshttps://doi.org/10.1051/ita/1989230201771openalex-snapshot
Nonuniform complexity classes specified by lower and upper bounds
inferred← citeshttps://doi.org/10.1103/revmodphys.74.347openalex-snapshot
Information and computation: Classical and quantum aspects
inferred← citeshttps://doi.org/10.1109/mwscas.1993.343180openalex-snapshot
Pattern theory paradigm for system design
inferred← citeshttps://doi.org/10.1109/sfcs.1980.22openalex-snapshot
Hardware complexity and parallel computation
inferred← citeshttps://doi.org/10.1109/tit.1982.1056592openalex-snapshot
On the power of straight- line computations in finite fields
inferred← citeshttps://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferred← citeshttps://doi.org/10.1137/0214001openalex-snapshot
An Optimal Simulation of Counter Machines
inferred← citeshttps://doi.org/10.1137/0216058openalex-snapshot
The Parallel Complexity of Abelian Permutation Group Problems
inferred← citeshttps://doi.org/10.1145/1283920.1283938openalex-snapshot
An overview of computational complexity
inferred← citeshttps://doi.org/10.1145/193820.193839openalex-snapshot
The quasilinear isomorphism challenge
inferred← citeshttps://doi.org/10.1145/322047.322060openalex-snapshot
Satisfiability Is Quasilinear Complete in NQL
inferred← citeshttps://doi.org/10.1145/322123.322138openalex-snapshot
Relations Among Complexity Measures
inferred← citeshttps://doi.org/10.1145/358141.358144openalex-snapshot
An overview of computational complexity
inferred← citeshttps://doi.org/10.1145/602220.602223openalex-snapshot
Cosmological lower bound on the circuit complexity of a small problem in logic
inferred← citeshttps://doi.org/10.1145/800061.808733openalex-snapshot
Borel sets and circuit complexity
inferred← citeshttps://doi.org/10.1145/800061.808762openalex-snapshot
A complexity theoretic approach to randomness
inferred← citeshttps://doi.org/10.1145/800070.802174openalex-snapshot
Real-time simulation of multicounters by oblivious one-tape turing machines (Preliminary Draft)
inferred← citeshttps://doi.org/10.1515/1569392031905557openalex-snapshot
Simulation of circuits of functional elements by the universal Turing machine
inferred← citeshttps://doi.org/10.2307/2273858openalex-snapshot
Classifying the computational complexity of problems
inferred← citeshttps://doi.org/10.3217/jucs-002-07-0533openalex-snapshot
Ceilings of Monotone Boolean Functions
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2010.03671openalex-snapshot
Cryptographic Properties of Several Classes of Rotation Symmetric Boolean Functions
inferred← citeshttps://doi.org/10.4213/dm155openalex-snapshot
Моделирование схем из функциональных элементов на универсальной машине Тьюринга
inferred← citeshttps://doi.org/10.5555/2343896.2343967openalex-snapshot
Complexity and approximability of social welfare optimization in multiagent resource allocation
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.