Lower bounds for Boolean circuits of bounded negation width.
Stasys JuknaAndrzej LingasPublished in: J. Comput. Syst. Sci. (2022)
Keyphrases
- lower bound
- truth table
- upper bound
- boolean functions
- branch and bound algorithm
- defeasible logic
- objective function
- upper and lower bounds
- logic programming
- high speed
- delay insensitive
- real valued
- logic programs
- logic synthesis
- lower and upper bounds
- branch and bound
- worst case
- vc dimension
- dnf formulas
- multi valued
- compositional semantics
- np hard
- logic circuits
- sample complexity
- lower bounding
- special case
- analog vlsi
- set of randomly generated instances
- optimal cost
- digital circuits
- quadratic assignment problem
- concept class
- circuit design
- datalog programs
- linear programming relaxation
- uniform distribution
- learning theory