An improved lower bound for the de Bruijn-Newman constant.
Yannick SaouterXavier GourdonPatrick DemichelPublished in: Math. Comput. (2011)
Keyphrases
- lower bound
- upper bound
- objective function
- arbitrarily close
- constant factor
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- upper and lower bounds
- worst case
- sufficiently accurate
- complex networks
- np hard
- graph structure
- lagrangian relaxation
- linear programming relaxation
- lower bounding
- optimal solution
- database
- real time