Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case
IEEE Transactions on Computers
A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints
Journal of Global Optimization
A PTAS for the minimization of polynomials of fixed degree over the simplex
Theoretical Computer Science - Approximation and online algorithms
| Hi-index | 0.00 |