New Non-FPT Lower Bounds for Some Arithmetic Formulas.
Nutan LimayeSrikanth SrinivasanSébastien TavenasPublished in: Electron. Colloquium Comput. Complex. (2021)
Keyphrases
- lower bound
- upper bound
- quantifier free
- branch and bound algorithm
- first order logic
- objective function
- np hard
- upper and lower bounds
- branch and bound
- lower and upper bounds
- optimal solution
- rewrite systems
- vc dimension
- quantifier elimination
- lower bounding
- arithmetic operations
- set of randomly generated instances
- mathematical formulas
- floating point
- quadratic assignment problem
- real numbers
- optimal cost
- randomly generated problems
- worst case
- sample complexity
- concept class
- linear programming relaxation
- linear programming
- propositional logic
- fixed parameter tractable
- special case