The conjunctive complexity of quadratic Boolean functions

DOI10.1016/0304-3975(91)90194-7MaRDI QIDQ808253zbMATH OpenOpenAlexFDO

Authors Katja Lenz, Ingo Wegener

Publication date 1991

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(91)90194-7

zbMATH Keywords

circuit complexitymonotone circuitsNP completeconjunctive complexityquadratic Boolean functionssingle level complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4074972
• Algorithms and Computation
• The monotone circuit complexity of quadratic Boolean functions
• Disproving the Single Level Conjecture
• The multiplicative complexity of quadratic boolean forms

Cites work

• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3445275 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Approximation algorithms for combinatorial problems
• Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Decomposition of graphs and monotone formula size of homogeneous functions
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Graph complexity
• On the complexity of slice functions
• On the coverings of graphs
• The monotone circuit complexity of Boolean functions
• The multiplicative complexity of quadratic boolean forms

Cited in

(11)

• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions
• The monotone circuit complexity of quadratic Boolean functions
• Quadratic sequential computations of Boolean mappings
• Local maxima of quadratic Boolean functions
• Finding efficient circuits for ensemble computation
• Weighted Boolean formula games
• Algorithms and Computation
• scientific article; zbMATH DE number 4074972 (Why is no real title available?)
• Minimal polynomials for the conjunction of functions on disjoint variables can be very simple
• On the complexity of minimizing quasicyclic Boolean functions

This page was built for publication: The conjunctive complexity of quadratic Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808253)