Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits.
Benedikt PagoPublished in: MFCS (2023)
Keyphrases
- lower bound
- worst case
- min sum
- upper bound
- satisfy the triangle inequality
- np hard
- branch and bound algorithm
- branch and bound
- objective function
- special case
- lower and upper bounds
- randomized algorithm
- integrality gap
- upper and lower bounds
- approximation algorithms
- linear programming relaxation
- vc dimension
- digital circuits
- analog vlsi
- high speed
- approximation ratio
- constant factor
- optimal solution
- tunnel diode
- statistical queries
- computational complexity
- optimal cost
- constant factor approximation algorithm
- logic synthesis
- quantum computing
- dnf formulas
- equivalence queries
- quadratic assignment problem
- circuit design
- max sat
- sample complexity