On the public citation graph
Information theory and the complexity of boolean functions
0 signed · 63 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/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1949.tb03624.xopenalex-snapshot
The Synthesis of Two-Terminal Switching Circuits
inferredcites →https://doi.org/10.1002/j.1538-7305.1950.tb00463.xopenalex-snapshot
Error Detecting and Error Correcting Codes
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferredcites →https://doi.org/10.1016/0020-0190(75)90007-1openalex-snapshot
On the complexity of inexact computations
inferredcites →https://doi.org/10.1016/0097-3165(74)90062-4openalex-snapshot
Two combinatorial covering theorems
inferredcites →https://doi.org/10.1080/00401706.1961.10489978openalex-snapshot
Error Correcting Codes
inferredcites →https://doi.org/10.1109/sfcs.1975.18openalex-snapshot
Information theory and the complexity of switching networks
inferredcites →https://doi.org/10.1109/t-c.1973.223704openalex-snapshot
Design of a Self-Checking Microprogram Control
inferredcites →https://doi.org/10.1109/tc.1973.5009171openalex-snapshot
Logical Network Cost and Entropy
inferredcites →https://doi.org/10.1109/tec.1956.5219786openalex-snapshot
Complexity in Electronic Switching Circuits
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-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-57370-4_53openalex-snapshot
On the sample complexity of consistent learning with one-sided error
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_27openalex-snapshot
Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness
inferred← citeshttps://doi.org/10.1007/978-1-4612-3774-7_6openalex-snapshot
Complexity of Random Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_43openalex-snapshot
On the Complexity of Breaking Pseudoentropy
inferred← citeshttps://doi.org/10.1007/s00037-016-0139-6openalex-snapshot
Quantum Query Complexity of Almost All Functions with Fixed On-set Size
inferred← citeshttps://doi.org/10.1016/1051-2004(92)90025-topenalex-snapshot
Combining stochastic and syntactic processing with analog computation methods
inferred← citeshttps://doi.org/10.1016/j.jtbi.2007.09.044openalex-snapshot
Systematic mistakes are likely in bounded optimal decision-making systems
inferred← citeshttps://doi.org/10.1016/j.vlsi.2014.01.002openalex-snapshot
High-level parameterizable area estimation modeling for ASIC designs
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00217-4openalex-snapshot
Optimal bounds for the approximation of boolean functions and some applications
inferred← citeshttps://doi.org/10.1070/rm2012v067n01abeh004777openalex-snapshot
Computational complexity of Boolean functions
inferred← citeshttps://doi.org/10.1080/03081077808960690openalex-snapshot
ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS
inferred← citeshttps://doi.org/10.1109/34.192486openalex-snapshot
Pattern recognition and Valiant's learning framework
inferred← citeshttps://doi.org/10.1109/34.3915openalex-snapshot
Automatic pattern recognition: a study of the probability of error
inferred← citeshttps://doi.org/10.1109/43.503929openalex-snapshot
Towards a high-level power estimation capability [digital ICs]
inferred← citeshttps://doi.org/10.1109/43.766722openalex-snapshot
High-level area and power estimation for VLSI circuits
inferred← citeshttps://doi.org/10.1109/9780470544907.ch2openalex-snapshot
Fifty Years of Shannon Theory
inferred← citeshttps://doi.org/10.1109/aspdac.1997.600067openalex-snapshot
An entropy measure for power estimation of Boolean functions
inferred← citeshttps://doi.org/10.1109/citisia.2009.5224219openalex-snapshot
Effect of Quine-McCluskey simplification on Boolean space complexity
inferred← citeshttps://doi.org/10.1109/dac.1990.114870openalex-snapshot
An entropy measure for the complexity of multi-output Boolean functions
inferred← citeshttps://doi.org/10.1109/glsv.1996.497613openalex-snapshot
Exact computation of the entropy of a logic circuit
inferred← citeshttps://doi.org/10.1109/isit.2007.4557274openalex-snapshot
Entropy with Limited Computation Resources
inferred← citeshttps://doi.org/10.1109/isqed.2000.838903openalex-snapshot
Quality of EDA CAD tools: definitions, metrics and directions
inferred← citeshttps://doi.org/10.1109/itwf.2015.7360745openalex-snapshot
Toward limits of constructing reliable memories from unreliable components
inferred← citeshttps://doi.org/10.1109/lpe.1996.547534openalex-snapshot
High-level power estimation and the area complexity of Boolean functions
inferred← citeshttps://doi.org/10.1109/lpe.2002.146753openalex-snapshot
High-level area estimation [logic design]
inferred← citeshttps://doi.org/10.1109/proc.1980.11783openalex-snapshot
The effect of DON'T CARES on the complexity of combinational circuits
inferred← citeshttps://doi.org/10.1109/tc.1986.1676729openalex-snapshot
Complexity Based on Partitioning of Boolean Circuits and their Relation to Multivalued Circuits
inferred← citeshttps://doi.org/10.1109/tcad.2003.814958openalex-snapshot
A test evaluation technique for vlsi circuits using register-transfer level fault modeling
inferred← citeshttps://doi.org/10.1109/tcad.2005.850904openalex-snapshot
Early power estimation for VLSI circuits
inferred← citeshttps://doi.org/10.1109/tcsi.2025.3606054openalex-snapshot
LLNN: A Scalable LUT-Based Logic Neural Network Architecture for FPGAs
inferred← citeshttps://doi.org/10.1109/test.2000.894305openalex-snapshot
Register-transfer level fault modeling and test evaluation techniques for VLSI circuits
inferred← citeshttps://doi.org/10.1109/tit.1979.1056031openalex-snapshot
Bounds on memory versus error trade-offs in question-answering systems
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.1109/tit.1986.1057209openalex-snapshot
The complexity of information extraction
inferred← citeshttps://doi.org/10.1109/tpami.1979.4766943openalex-snapshot
Capacity and Error Estimates for Boolean Classifiers with Limited Complexity
inferred← citeshttps://doi.org/10.1134/s1064562409060246openalex-snapshot
On coding of underdetermined sequences with a fidelity criterion
inferred← citeshttps://doi.org/10.1145/123186.123282openalex-snapshot
An entropy measure for the complexity of multi-output Boolean functions
inferred← citeshttps://doi.org/10.1145/224081.224097openalex-snapshot
Towards a high-level power estimation capability
inferred← citeshttps://doi.org/10.20948/mvk-2024-152openalex-snapshot
On circuit complexity of partial Boolean functions
inferred← citeshttps://doi.org/10.4230/dagsemproc.06111.19openalex-snapshot
The optimal sequence compression
inferred← citeshttps://doi.org/10.48550/arxiv.0908.2468openalex-snapshot
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
inferred← citeshttps://doi.org/10.5555/266388.266443openalex-snapshot
High-level area and power estimation for VLSI circuits
inferred← citeshttps://doi.org/10.7146/brics.v1i2.21668openalex-snapshot
Complexity of Nondeterministic Functions
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.