On the public citation graph
Complexity of the realization of a linear function in the class of II-circuits
0 signed · 47 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.1109/t-aiee.1938.5057767openalex-snapshot
A symbolic analysis of relay and 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.1002/rsa.3240040203openalex-snapshot
Shrinkage of de Morgan formulae under restriction
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_5openalex-snapshot
Relating Branching Program Size and Formula Size over the Full Binary Basis
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_12openalex-snapshot
Bounded Arithmetic and Lower Bounds in Boolean Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_17openalex-snapshot
New Bounds on the Half-Duplex Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_13openalex-snapshot
A New Rank Technique for Formula Size Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_5openalex-snapshot
Finding Efficient Circuits Using SAT-Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_58openalex-snapshot
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_37openalex-snapshot
Formula Complexity of Ternary Majorities
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_30openalex-snapshot
The Quantum Query Complexity of Read-Many Formulas
inferred← citeshttps://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferred← citeshttps://doi.org/10.1007/s00037-017-0156-0openalex-snapshot
The Average Sensitivity of Bounded-Depth Formulas
inferred← citeshttps://doi.org/10.1007/s10958-012-1104-9openalex-snapshot
Circuit complexity of linear functions: gate elimination and feeble security
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90191-jopenalex-snapshot
An extension of Khrapchenko's theorem
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90011-8openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-8858(91)90030-mopenalex-snapshot
Solution of Rota's problem on the order of series — Parallel networks
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.tcs.2012.02.005openalex-snapshot
A stronger LP bound for formula size lower bounds via clique constraints
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90382-5openalex-snapshot
Circuit-size lower bounds and non-reducibility to sparse sets
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00019-xopenalex-snapshot
Interpolants, cut elimination and flow graphs for the propositional calculus
inferred← citeshttps://doi.org/10.1070/rm2012v067n01abeh004777openalex-snapshot
Computational complexity of Boolean functions
inferred← citeshttps://doi.org/10.1109/ccc.2005.29openalex-snapshot
The Quantum Adversary Method and Classical Formula Size Lower Bounds
inferred← citeshttps://doi.org/10.1109/focs.2015.33openalex-snapshot
The Average Sensitivity of Bounded-Depth Formulas
inferred← citeshttps://doi.org/10.1109/fscs.1990.89586openalex-snapshot
Faster Circuits and Shorter Formulae for Multiple Addition, Multiplcation and Symmetric Boolean Functions
inferred← citeshttps://doi.org/10.1109/sfcs.1975.29openalex-snapshot
The effect of basis on size of Boolean expressions
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185385openalex-snapshot
Shrinkage of de Morgan formulae under restriction
inferred← citeshttps://doi.org/10.1134/s1990478913040133openalex-snapshot
A lower estimate for the computation complexity of a ternary linear function
inferred← citeshttps://doi.org/10.1134/s1990478915040146openalex-snapshot
Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions
inferred← citeshttps://doi.org/10.1134/s1990478918030146openalex-snapshot
Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes
inferred← citeshttps://doi.org/10.1134/s1990478919040148openalex-snapshot
On the Perfectness of Minimal Regular Partitions of the Edge Set of the n-Dimensional Cube
inferred← citeshttps://doi.org/10.1137/s009753979223633xopenalex-snapshot
Amplification by Read-Once Formulas
inferred← citeshttps://doi.org/10.1137/s0097539794261556openalex-snapshot
The Shrinkage Exponent of de Morgan Formulas is 2
inferred← citeshttps://doi.org/10.1142/s0129054113500378openalex-snapshot
BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS
inferred← citeshttps://doi.org/10.14288/1.0051610openalex-snapshot
Growth processes on formulas and reversible circuits
inferred← citeshttps://doi.org/10.1515/156939205776368887openalex-snapshot
On minimal π-circuits of closing contacts for symmetric functions with threshold 2
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.1008openalex-snapshot
NPN-Representatives of a Set of Optimal Boolean Formulas
inferred← citeshttps://doi.org/10.1587/transinf.2014fcp0011openalex-snapshot
Candidate Boolean Functions towards Super-Quadratic Formula Size
inferred← citeshttps://doi.org/10.3103/s0027132214020028openalex-snapshot
Representation of monomials as a sum of powers of linear forms
inferred← citeshttps://doi.org/10.4036/iis.2015.l.03openalex-snapshot
Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory
inferred← citeshttps://doi.org/10.4310/pamq.2024.v20.n3.a1openalex-snapshot
Topological aspects of Boolean functions
inferred← citeshttps://doi.org/10.5772/37084openalex-snapshot
Provably Secure Cryptographic Constructions
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.