Measurable lower bounds on concurrence.
Iman SargolzahiSayyed Yahya MirafzaliMohsen SarbishaeiPublished in: Quantum Inf. Comput. (2011)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- branch and bound
- np hard
- optimal solution
- lower and upper bounds
- worst case
- upper and lower bounds
- quadratic assignment problem
- data sets
- randomly generated problems
- lower bounding
- running times
- active learning
- linear programming relaxation
- linear programming
- database
- min sum