Ayanzadeh, RaminHalem, MiltonFinin, Tim2020-07-242020-07-242018-12-13Ramin Ayanzadeh, Milton Halem and Tim Finin, Solving Hard SAT Instances with Adiabatic Quantum Computers,https://agu.confex.com/agu/fm18/meetingapp.cgi/Paper/438647http://hdl.handle.net/11603/192366 pagesen-USThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.© 2018. American Geophysical UnionBoolean satisfiability problem (SAT)heuristicsmeta-heuristicsUMBC Ebiquity Research GroupText