Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds.
Ninad RajgopalRahul SanthanamSrikanth SrinivasanPublished in: MFCS (2018)
Keyphrases
- lower bound
- logic circuits
- upper bound
- objective function
- branch and bound algorithm
- np hard
- constant factor
- branch and bound
- low power
- worst case
- error correction
- depth map
- high speed
- optimal solution
- depth information
- vc dimension
- lower and upper bounds
- upper and lower bounds
- linear programming relaxation
- lower bounding
- quadratic assignment problem
- tunnel diode
- logic synthesis
- quantum computing
- data structure
- analog circuits
- asynchronous circuits
- randomly generated problems
- delay insensitive
- image sequences
- search algorithm
- linear programming