On the public citation graph
Complexity of Linear Boolean Operators
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.1006/jcss.1995.1065openalex-snapshot
Clique Partitions, Graph Compression and Speeding-Up Algorithms
inferredcites →https://doi.org/10.1007/3-540-09526-8_36openalex-snapshot
Some remarks on Boolean sums
inferredcites →https://doi.org/10.1007/978-3-0348-5438-2_10openalex-snapshot
On the decomposition of graphs into complete bipartite subgraphs
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/978-3-642-22670-0_4openalex-snapshot
On the Circuit Complexity of Perfect Hashing
inferredcites →https://doi.org/10.1007/978-3-642-24508-4openalex-snapshot
Boolean Function Complexity: Advances and Frontiers
inferredcites →https://doi.org/10.1007/978-3-642-35261-4_29openalex-snapshot
More on a Problem of Zarankiewicz
inferredcites →https://doi.org/10.1007/978-3-662-03338-8openalex-snapshot
Algebraic Complexity Theory
inferredcites →https://doi.org/10.1007/bf00263988openalex-snapshot
A new lower bound on the monotone network complexity of Boolean sums
inferredcites →https://doi.org/10.1007/bf00264314openalex-snapshot
Decomposition of graphs and monotone formula size of homogeneous functions
inferredcites →https://doi.org/10.1007/bf00289470openalex-snapshot
Schnelle Multiplikation von Polynomen �ber K�rpern der Charakteristik 2
inferredcites →https://doi.org/10.1007/bf01137685openalex-snapshot
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
inferredcites →https://doi.org/10.1007/bf01215351openalex-snapshot
Communication in bounded depth circuits
inferredcites →https://doi.org/10.1007/bf01261323openalex-snapshot
Norm-graphs and bipartite tur�n numbers
inferredcites →https://doi.org/10.1007/bf01693976openalex-snapshot
Application of separability and independence notions for proving lower bounds of circuit complexity
inferredcites →https://doi.org/10.1007/bf01776581openalex-snapshot
The minimum number of edges in graphs with prescribed paths
inferredcites →https://doi.org/10.1007/bf02579163openalex-snapshot
Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices
inferredcites →https://doi.org/10.1007/bf02579382openalex-snapshot
Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory
inferredcites →https://doi.org/10.1007/bfb0036901openalex-snapshot
Lower bounds for constant depth circuits for prefix problems
inferredcites →https://doi.org/10.1007/bfb0054136openalex-snapshot
Towards a better understanding of one-wayness: Facing linear permutations
inferredcites →https://doi.org/10.1007/s00224-008-9133-yopenalex-snapshot
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
inferredcites →https://doi.org/10.1007/s10598-013-9166-1openalex-snapshot
Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
inferredcites →https://doi.org/10.1007/s10986-012-9181-5openalex-snapshot
On the CNF-complexity of bipartite graphs containing no squares
inferredcites →https://doi.org/10.1016/0012-365x(94)00115-yopenalex-snapshot
Some combinatorial-algebraic problems from complexity theory
inferredcites →https://doi.org/10.1016/0022-0000(82)90056-3openalex-snapshot
Superconcentrators of depth 2
inferredcites →https://doi.org/10.1016/0022-0000(85)90015-7openalex-snapshot
Unbounded fan-in circuits and associative functions
inferredcites →https://doi.org/10.1016/0022-0000(88)90002-5openalex-snapshot
Meanders and their applications in lower bounds arguments
inferredcites →https://doi.org/10.1016/0022-247x(68)90163-7openalex-snapshot
Applications of Menger's graph theorem
inferredcites →https://doi.org/10.1016/0304-3975(80)90034-1openalex-snapshot
On another Boolean matrix
inferredcites →https://doi.org/10.1016/0304-3975(82)90014-7openalex-snapshot
Additive complexity in directed computations
inferredcites →https://doi.org/10.1016/0304-3975(82)90113-xopenalex-snapshot
A family of graphs with expensive depth-reduction
inferredcites →https://doi.org/10.1016/0898-1221(75)90037-1openalex-snapshot
On sparse graphs with dense long paths
inferredcites →https://doi.org/10.1016/j.disc.2009.07.011openalex-snapshot
Representing (0, 1)-matrices by boolean circuits
inferredcites →https://doi.org/10.1016/j.jcss.2009.09.003openalex-snapshot
Min-rank conjecture for log-depth circuits
inferredcites →https://doi.org/10.1016/j.tcs.2014.10.014openalex-snapshot
Cancellation-free circuits in unbounded and bounded depth
inferredcites →https://doi.org/10.1016/s0020-0190(00)00058-2openalex-snapshot
A note on the use of determinant for proving lower bounds on the size of linear circuits
inferredcites →https://doi.org/10.1016/s0022-0000(05)80027-3openalex-snapshot
Superconcentrators of depths 2 and 3; odd levels help (rarely)
inferredcites →https://doi.org/10.1016/s0022-0000(76)80041-4openalex-snapshot
Graph-theoretic properties in computational complexity
inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1070/sm2012v203n10abeh004270openalex-snapshot
A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
inferredcites →https://doi.org/10.1090/s0002-9947-1938-1501951-4openalex-snapshot
A theorem in finite projective geometry and some applications to number theory
inferredcites →https://doi.org/10.1109/18.556668openalex-snapshot
Linear-time encodable and decodable error-correcting codes
inferredcites →https://doi.org/10.1109/ccc.2012.39openalex-snapshot
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators
inferredcites →https://doi.org/10.1109/sfcs.1976.21openalex-snapshot
On the evaluation of powers and related problems
inferredcites →https://doi.org/10.1112/jlms/s1-35.1.85openalex-snapshot
Intersection Theorems for Systems of Sets
inferredcites →https://doi.org/10.1134/s1990478911020074openalex-snapshot
On the complexity of linear boolean operators with thin matrices
inferredcites →https://doi.org/10.1137/0217015openalex-snapshot
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
inferredcites →https://doi.org/10.1137/0219074openalex-snapshot
Linear Circuits over $\operatorname{GF}(2)$
inferredcites →https://doi.org/10.1137/s0097539705447001openalex-snapshot
Disproving the Single Level Conjecture
inferredcites →https://doi.org/10.1137/s0895480190283595openalex-snapshot
Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
inferredcites →https://doi.org/10.1137/s0895480197329508openalex-snapshot
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
inferredcites →https://doi.org/10.1145/2213977.2214023openalex-snapshot
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
inferredcites →https://doi.org/10.1145/321752.321761openalex-snapshot
Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
inferredcites →https://doi.org/10.1145/321879.321881openalex-snapshot
The Linear Complexity of Computation
inferredcites →https://doi.org/10.1145/800061.808731openalex-snapshot
Superconcentrators, generalizers and generalized connectors with limited depth
inferredcites →https://doi.org/10.1515/dma.2008.011openalex-snapshot
On complexity of linear operators on the class of circuits of depth 2
inferredcites →https://doi.org/10.1515/dma.2011.031openalex-snapshot
Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
inferredcites →https://doi.org/10.1561/0400000011openalex-snapshot
Complexity Lower Bounds using Linear Algebra
inferredcites →https://doi.org/10.18311/jims/1942/17165openalex-snapshot
An Affine Analogue of Singer's Theorem
inferredcites →https://doi.org/10.37236/32openalex-snapshot
A Complete Annotated Bibliography of Work Related to Sidon Sequences
inferredcites →https://doi.org/10.4064/aa-65-3-259-282openalex-snapshot
Solving a linear equation in a set of integers I
inferredcites →https://doi.org/10.48550/arxiv.1207.5321openalex-snapshot
Cancellation-free circuits: An approach for proving superlinear lower bounds for linear Boolean operators
inferredcites →https://doi.org/10.48550/arxiv.1305.4389openalex-snapshot
Implementation of linear maps with circulant matrices via modulo 2 rectifier circuits of bounded depth
inferredcites →https://doi.org/10.48550/arxiv.1307.6363openalex-snapshot
Biclique Covers and Partitions
inferredcites →https://doi.org/10.5446/15981openalex-snapshot
P, NP and mathematics - a computational complexity perspective
inferredcites →https://doi.org/10.5555/314613.314845openalex-snapshot
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_6openalex-snapshot
On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_16openalex-snapshot
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_2openalex-snapshot
Lower Bounds for Unrestricted Boolean Circuits: Open Problems
inferred← citeshttps://doi.org/10.1007/s00037-021-00205-2openalex-snapshot
Lower Bounds for Matrix Factorization
inferred← citeshttps://doi.org/10.1007/s11856-025-2732-3openalex-snapshot
Applications of random algebraic constructions to hardness of approximation
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.01.001openalex-snapshot
Separating OR, SUM, and XOR circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.014openalex-snapshot
Cancellation-free circuits in unbounded and bounded depth
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00032openalex-snapshot
Applications of Random Algebraic Constructions to Hardness of Approximation
inferred← citeshttps://doi.org/10.1109/tc.2018.2874662openalex-snapshot
Better Circuits for Binary Polynomial Multiplication
inferred← citeshttps://doi.org/10.1134/s0001434616070166openalex-snapshot
On the additive complexity of GCD and LCM matrices
inferred← citeshttps://doi.org/10.1134/s0001434625605143openalex-snapshot
Lower Bounds for Additive Complexity of Linear Operators and Bilinear Algorithms for Matrix and Polynomial Multiplication over $$GF(2)$$
inferred← citeshttps://doi.org/10.1134/s1990478918010143openalex-snapshot
Rectifier Circuits of Bounded Depth
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch160openalex-snapshot
Smaller Low-Depth Circuits for Kronecker Powers
inferred← citeshttps://doi.org/10.1137/21m1443339openalex-snapshot
Kronecker Products, Low-Depth Circuits, and Matrix Rigidity
inferred← citeshttps://doi.org/10.1145/3406325.3451008openalex-snapshot
Kronecker products, low-depth circuits, and matrix rigidity
inferred← citeshttps://doi.org/10.20948/mvk-2022-119openalex-snapshot
Bellman's, Knut's, Lupanov's, Pippenger's problems and their variations as generalizations of the addition chain problem
inferred← citeshttps://doi.org/10.3103/s0027132222030068openalex-snapshot
Comparing the Computational Complexity of Monomials and Elements of Finite Abelian Groups
inferred← citeshttps://doi.org/10.3103/s0027132223040034openalex-snapshot
On the Computation Complexity of the Systems of Finite Abelian Group Elements
inferred← citeshttps://doi.org/10.4213/mzm10626openalex-snapshot
Об аддитивной сложности матриц НОД и НОК
inferred← citeshttps://doi.org/10.4213/mzm14541openalex-snapshot
Нижние оценки аддитивной сложности линейных операторов и билинейных алгоритмов умножения матриц и многочленов над $GF(2)$
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.5openalex-snapshot
Lower Bounds for Matrix Factorization
inferred← citeshttps://doi.org/10.48550/arxiv.1407.4626openalex-snapshot
On relative OR-complexity of Boolean matrices and their complements
inferred← citeshttps://doi.org/10.55959/msu0579-9368-1-64-4-4openalex-snapshot
О сложности вычисления систем элементов конечных абелевых групп
inferred← citeshttps://doi.org/10.70675/e70b70f9z8381z43a4z806fz68402f3080deopenalex-snapshot
Methods for optimizing the synthesis of quantum circuits
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.