Abstract
Unique Sink Orientations (USOs) are orientations of the hypercube graph capable of encoding many optimization problems, such as linear programming. When a USO is given in implicit form as an oracle, the USO recognition problem aims to distinguish USO from non-USO oracles. In this thesis we introduce a new type of orientation, the pseudo-USOs, which are closely related to the USO recognition problem. We derive many of their combinatorial properties, up to and including a full characterization. Using these properties, we design efficient USO recognition algorithms both in the classical and quantum models of computation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.