On the public citation graph
The monotone circuit complexity of boolean functions
0 signed · 331 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.1949.tb03624.xopenalex-snapshot
The Synthesis of Two-Terminal Switching Circuits
inferredcites →https://doi.org/10.1007/3-540-07389-2_214openalex-snapshot
Monotone switching circuits and boolean matrix product
inferredcites →https://doi.org/10.1007/bfb0017292openalex-snapshot
Boolean functions whose monotone complexity is of size n2/log n
inferredcites →https://doi.org/10.1016/0020-0190(84)90111-xopenalex-snapshot
A 4n-lower bound on the monotone network complexity of a one-output boolean function
inferredcites →https://doi.org/10.1016/0304-3975(75)90009-2openalex-snapshot
Complexity of monotone networks for Boolean matrix product
inferredcites →https://doi.org/10.1016/0304-3975(83)90029-4openalex-snapshot
A Boolean function requiring 3n network size
inferredcites →https://doi.org/10.1016/0304-3975(89)90084-4openalex-snapshot
Boolean functions whose monotone complexity is of size n2log n
inferredcites →https://doi.org/10.1112/jlms/s1-35.1.85openalex-snapshot
Intersection Theorems for Systems of Sets
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0204027openalex-snapshot
The Power of Negative Thinking in Multiplying Boolean Matrices
inferredcites →https://doi.org/10.1145/3149.3158openalex-snapshot
A complexity theory based on Boolean algebra
inferredcites →https://doi.org/10.1145/3749740.3749750openalex-snapshot
Completeness Classes in Algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1521-3870(200111)47:4<461::aid-malq461>3.0.co;2-bopenalex-snapshot
Monotone Proofs of the Pigeon Hole Principle
inferred← citeshttps://doi.org/10.1006/inco.1995.1083openalex-snapshot
Loop Circuits and Their Relation to Razborov′s Approximation Model
inferred← citeshttps://doi.org/10.1006/inco.2002.3114openalex-snapshot
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution
inferred← citeshttps://doi.org/10.1006/jcss.1998.1617openalex-snapshot
An Exponential Lower Bound for the Size of Monotone Real Circuits
inferred← citeshttps://doi.org/10.1006/jctb.1993.1052openalex-snapshot
A Strengthening of Ben Rebea′s Lemma
inferred← citeshttps://doi.org/10.1007/11809678_13openalex-snapshot
On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_16openalex-snapshot
A fast parallel algorithm for computing all maximal cliques in a graph and the related problems
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_13openalex-snapshot
Monotone Proofs of the Pigeon Hole Principle
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_38openalex-snapshot
On the Automatizability of Resolution and Related Propositional Proof Systems
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_36openalex-snapshot
Vertex Partitioning of Crown-Free Interval Graphs
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_11openalex-snapshot
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_81openalex-snapshot
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_20openalex-snapshot
On the Negation-Limited Circuit Complexity of Merging
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_60openalex-snapshot
A lower bound for solvability of polynomial equations
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_130openalex-snapshot
My favorite ten complexity theorems of the past decade
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_116openalex-snapshot
Lower bounds for prepositional proofs and independence results in bounded arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_58openalex-snapshot
Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits
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-1-4612-2566-9_8openalex-snapshot
On Proving Lower Bounds for Circuit Size
inferred← citeshttps://doi.org/10.1007/978-1-4614-7258-2_26openalex-snapshot
On Small Size Approximation Models
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_46openalex-snapshot
On the Mystery of Negations in Circuits: Structure vs Power
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_25openalex-snapshot
Monotone Circuit Lower Bounds from Robust Sunflowers
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_15openalex-snapshot
Acyclicity Programming for Sigma-Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-23101-8_20openalex-snapshot
Lower Bounds for Monotone q-Multilinear Boolean Circuits
inferred← citeshttps://doi.org/10.1007/978-3-031-42354-3_4openalex-snapshot
Bounds for Approximating Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_51openalex-snapshot
Depth Lower Bounds against Circuits with Sparse Orientation
inferred← citeshttps://doi.org/10.1007/978-3-319-20297-6_2openalex-snapshot
Circuit Complexity Meets Ontology-Based Data Access
inferred← citeshttps://doi.org/10.1007/978-3-319-32162-2_1openalex-snapshot
$$P\mathop{ =}\limits^{?}NP$$
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_18openalex-snapshot
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-49890-4_21openalex-snapshot
Secret Sharing for mNP: Completeness Results
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_29openalex-snapshot
Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_26openalex-snapshot
Dag-Like Communication and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_5openalex-snapshot
On the Monotone Circuit Complexity of Quadratic Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_29openalex-snapshot
Remarks on Graph Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_54openalex-snapshot
Negation-Limited Inverters of Linear Size
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_58openalex-snapshot
Limiting Negations in Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_2openalex-snapshot
On Negations in Boolean Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_3openalex-snapshot
Proof Complexity of Non-classical Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-15579-6_19openalex-snapshot
Sans Constraints? Feature Diagrams vs. Feature Models
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_28openalex-snapshot
Translating Pseudo-Boolean Constraints into CNF
inferred← citeshttps://doi.org/10.1007/978-3-642-24508-4openalex-snapshot
Boolean Function Complexity: Advances and Frontiers
inferred← citeshttps://doi.org/10.1007/978-3-642-31485-8openalex-snapshot
Lectures on Logic and Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-31485-8_1openalex-snapshot
Proof Complexity of Non-classical Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_26openalex-snapshot
Exponential Lower Bounds and Separation for Query Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_38openalex-snapshot
Streaming and Communication Complexity of Clique Approximation
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_49openalex-snapshot
A Conditional Superpolynomial Lower Bound for Extended Resolution
inferred← citeshttps://doi.org/10.1007/978-3-642-39784-4_5openalex-snapshot
Ontology-Based Data Access with Databases: A Short Course
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_5openalex-snapshot
Propositional Proof Complexity an Introduction
inferred← citeshttps://doi.org/10.1007/978-3-642-60408-9_28openalex-snapshot
On Small Size Approximation Models
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_20openalex-snapshot
On DNF Approximators for Monotone Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_15openalex-snapshot
Feasible Interpolation for QBF Resolution Calculi
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_21openalex-snapshot
An Exponential Lower Bound for Proofs in Focused Calculi
inferred← citeshttps://doi.org/10.1007/978-3-7091-9461-4_4openalex-snapshot
A Fundamental Problem of Mathematical Logic
inferred← citeshttps://doi.org/10.1007/bf01137685openalex-snapshot
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
inferred← citeshttps://doi.org/10.1007/bf01202040openalex-snapshot
Lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1007/bf01268142openalex-snapshot
PI k mass production and an optimal circuit for the Ne?iporuk slice
inferred← citeshttps://doi.org/10.1007/bf01272517openalex-snapshot
On the power of small-depth threshold circuits
inferred← citeshttps://doi.org/10.1007/bf02122563openalex-snapshot
The gap between monotone and non-monotone circuit complexity is exponential
inferred← citeshttps://doi.org/10.1007/bf02122698openalex-snapshot
Applications of matrix methods to the theory of lower bounds in computational complexity
inferred← citeshttps://doi.org/10.1007/bfb0016269openalex-snapshot
Lower bounds on the complexity of local circuits
inferred← citeshttps://doi.org/10.1007/bfb0017160openalex-snapshot
Two lower bounds for circuits over the basis (&, V, -)
inferred← citeshttps://doi.org/10.1007/bfb0020801openalex-snapshot
Polynomial size constant depth circuits with a limited number of negations
inferred← citeshttps://doi.org/10.1007/bfb0053959openalex-snapshot
Approximations of independent sets in graphs
inferred← citeshttps://doi.org/10.1007/bfb0054322openalex-snapshot
Spectral techniques in graph algorithms
inferred← citeshttps://doi.org/10.1007/bfb0055789openalex-snapshot
A superpolynomial lower bound for a circuit computing the clique function with at most (1/6) log log n negation gates
inferred← citeshttps://doi.org/10.1007/bfb0055813openalex-snapshot
Optimizing OBDDs is still intractable for monotone functions
inferred← citeshttps://doi.org/10.1007/s00037-004-0183-5openalex-snapshot
Non-Automatizability of Bounded-Depth Frege Proofs
inferred← citeshttps://doi.org/10.1007/s00037-011-0033-1openalex-snapshot
Satisfiability, Branch-Width and Tseitin tautologies
inferred← citeshttps://doi.org/10.1007/s00037-013-0060-1openalex-snapshot
On Sunflowers and Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/s00037-016-0138-7openalex-snapshot
Sunflowers and Testing Triangle-Freeness of Functions
inferred← citeshttps://doi.org/10.1007/s000370050017openalex-snapshot
Symmetric approximation arguments for monotone lower bounds without sunflowers
inferred← citeshttps://doi.org/10.1007/s000370100001openalex-snapshot
A characterization of span program size and improved lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1007/s00224-002-1068-0openalex-snapshot
Graph Complexity and Slice Functions
inferred← citeshttps://doi.org/10.1007/s00224-014-9574-4openalex-snapshot
Lower Bounds for Tropical Circuits and Dynamic Programs
inferred← citeshttps://doi.org/10.1007/s00224-016-9707-zopenalex-snapshot
Bounds in Ontology-Based Data Access via Circuit Complexity
inferred← citeshttps://doi.org/10.1007/s00224-016-9740-yopenalex-snapshot
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1007/s00453-006-0073-0openalex-snapshot
The Monotone Circuit Complexity of Quadratic Boolean Functions
inferred← citeshttps://doi.org/10.1007/s00453-022-01000-3openalex-snapshot
Monotone Circuit Lower Bounds from Robust Sunflowers
inferred← citeshttps://doi.org/10.1007/s004930050058openalex-snapshot
Superpolynomial Lower Bounds for Monotone Span Programs
inferred← citeshttps://doi.org/10.1007/s10109-023-00419-8openalex-snapshot
Sensitivity metrics of complex network based on co-occurrence truth table: exemplified by a high-speed rail network
inferred← citeshttps://doi.org/10.1007/s11047-014-9438-5openalex-snapshot
Logic circuits from zero forcing
inferred← citeshttps://doi.org/10.1007/s11856-023-2510-zopenalex-snapshot
Shadows of Newton polytopes
inferred← citeshttps://doi.org/10.1007/s40314-020-1090-3openalex-snapshot
Independence and matching numbers of unicyclic graphs from null space
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90184-wopenalex-snapshot
A simple lower bound for monotone clique using a communication game
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00221-jopenalex-snapshot
A note on the power of majority gates and modular gates
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00080-4openalex-snapshot
On the number of ANDs versus the number of ORs in monotone Boolean circuits
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00115-9openalex-snapshot
Negation-limited circuit complexity of symmetric functions
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90010-9openalex-snapshot
A lower bound for read-once-only branching programs
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-6774(87)90021-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90122-2openalex-snapshot
The complexity of central slice functions
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90166-1openalex-snapshot
Entropy of contact circuits and lower bounds on their complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90142-4openalex-snapshot
On monotone simulations of nonmonotone networks
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90194-7openalex-snapshot
The conjunctive complexity of quadratic Boolean functions
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00048-nopenalex-snapshot
On almost bad Boolean bases
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90072-aopenalex-snapshot
Lower bounds for depth-restricted branching programs
inferred← citeshttps://doi.org/10.1016/0893-6080(96)00130-xopenalex-snapshot
On the Circuit Complexity of Sigmoid Feedforward Neural Networks
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50019-9openalex-snapshot
The Complexity of Finite Functions
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50042-7openalex-snapshot
10.1016/b978-044488002-4/50042-7
inferred← citeshttps://doi.org/10.1016/j.apal.2007.01.001openalex-snapshot
A lower bound for intuitionistic logic
inferred← citeshttps://doi.org/10.1016/j.apal.2008.04.001openalex-snapshot
Resolution over linear equations and multilinear proofs
inferred← citeshttps://doi.org/10.1016/j.apal.2008.09.013openalex-snapshot
On lengths of proofs in non-classical logics
inferred← citeshttps://doi.org/10.1016/j.apal.2008.10.005openalex-snapshot
Substitution Frege and extended Frege proof systems in non-classical logics
inferred← citeshttps://doi.org/10.1016/j.apal.2010.10.002openalex-snapshot
A sorting network in bounded arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.009openalex-snapshot
Towards NP – P via proof complexity and search
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102892openalex-snapshot
The canonical pairs of bounded depth Frege systems
inferred← citeshttps://doi.org/10.1016/j.apal.2021.102972openalex-snapshot
Proof complexity of substructural logics
inferred← citeshttps://doi.org/10.1016/j.artint.2014.04.004openalex-snapshot
The price of query rewriting in ontology-based data access
inferred← citeshttps://doi.org/10.1016/j.dam.2013.04.026openalex-snapshot
Finding a smallest odd hole in a claw-free graph using global structure
inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.024openalex-snapshot
Lower bounds for monotone counting circuits
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.023openalex-snapshot
Notes on Boolean read- k and multilinear circuits
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.028openalex-snapshot
The splitting power of branching programs of bounded repetition and CNFs of bounded width
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.036openalex-snapshot
Very large cliques are easy to detect
inferred← citeshttps://doi.org/10.1016/j.ic.2003.10.004openalex-snapshot
On the automatizability of resolution and related propositional proof systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.07.003openalex-snapshot
Clique problem, cutting plane proofs and communication complexity
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2008.05.035openalex-snapshot
One-way permutations, computational asymmetry and distortion
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.05.003openalex-snapshot
Lower bounds for Boolean circuits of bounded negation width
inferred← citeshttps://doi.org/10.1016/j.orl.2009.10.010openalex-snapshot
On the complexity of cutting-plane proofs using split cuts
inferred← citeshttps://doi.org/10.1016/j.orl.2012.03.008openalex-snapshot
Cutting planes cannot approximate some integer programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.018openalex-snapshot
Limiting negations in non-deterministic circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.021openalex-snapshot
Nondeterministic functions and the existence of optimal proof systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.03.005openalex-snapshot
Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00045-3openalex-snapshot
Claw-free graphs — A survey
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00264-2openalex-snapshot
An exponential gap with the removal of one negation gate
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00007-0openalex-snapshot
Monotone real circuits are more powerful than monotone boolean circuits
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00021-1openalex-snapshot
Affine projections of symmetric polynomials
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00215-9openalex-snapshot
On the negation-limited circuit complexity of merging
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00170-4openalex-snapshot
Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00321-7openalex-snapshot
On the bottleneck counting argument
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80206-3openalex-snapshot
Chapter 9 Computational complexity
inferred← citeshttps://doi.org/10.1017/9781108242066.006openalex-snapshot
Quantified Propositional Calculus
inferred← citeshttps://doi.org/10.1017/9781108242066.008openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.010openalex-snapshot
Basic Example of the Correspondence between Theories and Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.011openalex-snapshot
The Two Worlds of Bounded Arithmetic
inferred← citeshttps://doi.org/10.1017/9781108242066.012openalex-snapshot
Up to EF via the 〈. . .〉 Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.013openalex-snapshot
Examples of Upper Bounds and p-Simulations
inferred← citeshttps://doi.org/10.1017/9781108242066.014openalex-snapshot
Beyond EF via the || . . . || Translation
inferred← citeshttps://doi.org/10.1017/9781108242066.016openalex-snapshot
LKd+1/2 and Combinatorial Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.017openalex-snapshot
Fd and Logical Restrictions
inferred← citeshttps://doi.org/10.1017/9781108242066.018openalex-snapshot
Algebraic and Geometric Proof Systems
inferred← citeshttps://doi.org/10.1017/9781108242066.019openalex-snapshot
Feasible Interpolation: A Framework
inferred← citeshttps://doi.org/10.1017/9781108242066.020openalex-snapshot
Feasible Interpolation: Applications
inferred← citeshttps://doi.org/10.1017/9781108242066.022openalex-snapshot
Model Theory and Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781108242066.024openalex-snapshot
The Nature of Proof Complexity
inferred← citeshttps://doi.org/10.1070/im1995v059n01abeh000009openalex-snapshot
Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic
inferred← citeshttps://doi.org/10.1070/rm2003v058n05abeh000667openalex-snapshot
Monotone Boolean functions
inferred← citeshttps://doi.org/10.1070/rm2012v067n01abeh004777openalex-snapshot
Computational complexity of Boolean functions
inferred← citeshttps://doi.org/10.1070/sm2012v203n10abeh004270openalex-snapshot
A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
inferred← citeshttps://doi.org/10.1109/aspdac.2017.7858313openalex-snapshot
Multi-level logic benchmarks: An exactness study
inferred← citeshttps://doi.org/10.1109/ccc.1997.612324openalex-snapshot
A note on the bottleneck counting argument
inferred← citeshttps://doi.org/10.1109/ccc.1997.612325openalex-snapshot
Finite limits and monotone computations: the lower bounds criterion
inferred← citeshttps://doi.org/10.1109/ccc.2011.36openalex-snapshot
Non-uniform ACC Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1109/csf68417.2026.00021openalex-snapshot
Revisiting Beimel-Weinreb Weighted Threshold Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1109/focs.2010.26openalex-snapshot
The Monotone Complexity of k-clique on Random Graphs
inferred← citeshttps://doi.org/10.1109/focs.2010.58openalex-snapshot
Bounds on Monotone Switching Networks for Directed Connectivity
inferred← citeshttps://doi.org/10.1109/focs.2013.70openalex-snapshot
Average Case Lower Bounds for Monotone Switching Networks
inferred← citeshttps://doi.org/10.1109/focs.2015.16openalex-snapshot
If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
inferred← citeshttps://doi.org/10.1109/focs.2017.19openalex-snapshot
Random Θ(log n)-CNFs Are Hard for Cutting Planes
inferred← citeshttps://doi.org/10.1109/focs.2017.20openalex-snapshot
Random Formulas, Monotone Circuits, and Interpolation
inferred← citeshttps://doi.org/10.1109/focs.2019.00078openalex-snapshot
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00011openalex-snapshot
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
inferred← citeshttps://doi.org/10.1109/fscs.1990.89582openalex-snapshot
On the power of small-depth threshold circuits
inferred← citeshttps://doi.org/10.1109/sct.1993.336535openalex-snapshot
On proving lower bounds for circuit size
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185341openalex-snapshot
Approximating clique is almost NP-complete
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365685openalex-snapshot
A lower bound for the monotone depth of connectivity
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492460openalex-snapshot
Counting bottlenecks to show monotone P≠NP
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492669openalex-snapshot
Lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548502openalex-snapshot
Potential of the approximation method
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646112openalex-snapshot
Separation of the monotone NC hierarchy
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646114openalex-snapshot
No feasible interpolation for TC/sup 0/-Frege proofs
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181983openalex-snapshot
Satisfiability, branch-width and Tseitin tautologies
inferred← citeshttps://doi.org/10.1109/smc54092.2024.10831329openalex-snapshot
Learning Circuit Complexity of Boolean Functions
inferred← citeshttps://doi.org/10.1109/tc.2025.3533096openalex-snapshot
Small Hazard-Free Transducers
inferred← citeshttps://doi.org/10.1109/tnnls.2024.3387878openalex-snapshot
Size and Depth of Monotone Neural Networks: Interpolation and Approximation
showing the first 200 of 318 · page through all 318
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.