Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds
Mart de GraafPaul ValiantPublished in: CoRR (2002)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- low degree
- objective function
- lower and upper bounds
- worst case
- np hard
- lower bounding
- linear programming relaxation
- optimal cost
- optimal solution
- polynomial approximation
- computational complexity
- social networks
- low order
- online algorithms
- statistical queries
- average case complexity