Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits.
Benedikt PagoPublished in: CoRR (2023)
Keyphrases
- lower bound
- worst case
- min sum
- upper bound
- satisfy the triangle inequality
- branch and bound algorithm
- special case
- randomized algorithm
- analog circuits
- high speed
- branch and bound
- truth table
- constant factor
- lower and upper bounds
- upper and lower bounds
- approximation algorithms
- computational complexity
- optimal solution
- analog vlsi
- integrality gap
- quantum computing
- statistical queries
- lower bounding
- np hard
- delay insensitive
- objective function
- quadratic assignment problem
- vc dimension
- logic synthesis
- set of randomly generated instances
- dnf formulas
- randomly generated problems
- min cost
- online algorithms
- tunnel diode