No O(N) queries for checking if N intervals cover everything or for piercing N pairs of intervals. An O(N log N)-steps algorithm for piercing

Mathematics – Combinatorics

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.