Solving Hard SAT Instances with Adiabatic Quantum Computers

dc.contributor.authorAyanzadeh, Ramin
dc.contributor.authorHalem, Milton
dc.contributor.authorFinin, Tim
dc.date.accessioned2020-07-24T16:11:14Z
dc.date.available2020-07-24T16:11:14Z
dc.date.issued2018-12-13
dc.description.sponsorshipNASA Grant (#NNH16ZDA001N-AIST 16-0091) NIH-NIGMS Initiative for Maximizing Student Development Grant (2 R25-GM55036) Google Lime scholarship eBiquity Research Group D-Wave Systems for access to D-Wave 2000Q quantum computer (Burnaby, Canada) Center for Hybrid Multicore Productivity Research (CHMPR) access support to IBM Minsky cluster
dc.description.urihttps://agu.confex.com/agu/fm18/meetingapp.cgi/Paper/438647en_US
dc.format.extent6 pagesen_US
dc.genrepostersen_US
dc.identifierdoi:10.13016/m23dw4-m1vu
dc.identifier.citationRamin Ayanzadeh, Milton Halem and Tim Finin, Solving Hard SAT Instances with Adiabatic Quantum Computers,https://agu.confex.com/agu/fm18/meetingapp.cgi/Paper/438647en_US
dc.identifier.urihttp://hdl.handle.net/11603/19236
dc.language.isoen_USen_US
dc.publisherAGU Pubicationen_US
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Computer Science and Electrical Engineering Department Collection
dc.relation.ispartofUMBC Faculty Collection
dc.relation.ispartofUMBC Student Collection
dc.rightsThis 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.
dc.rights© 2018. American Geophysical Union
dc.subjectBoolean satisfiability problem (SAT)en_US
dc.subjectheuristicsen_US
dc.subjectmeta-heuristicsen_US
dc.subjectUMBC Ebiquity Research Group
dc.titleSolving Hard SAT Instances with Adiabatic Quantum Computersen_US
dc.typeTexten_US

Files

License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.56 KB
Format:
Item-specific license agreed upon to submission
Description: