A new Lenstra-type Algorithm for Quasiconvex Polynomial Integer Minimization with Complexity 2^O(n log n)

Mathematics – Optimization and Control

Scientific paper


  [ 0.00 ] – not rated yet Voters 0   Comments 0

Please leave your Comment & Rating

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.