Solving Hard SAT Instances with Adiabatic Quantum Computers

No Thumbnail Available

Links to Files

https://agu.confex.com/agu/fm18/meetingapp.cgi/Paper/438647

Permanent Link

http://hdl.handle.net/11603/19236

Collections

UMBC Computer Science and Electrical Engineering Department
UMBC Faculty Collection
UMBC Student Collection

Author/Creator

Author/Creator ORCID

Date

2018-12-13

Type of Work

posters
Text

Department

Program

Citation of Original Publication

Ramin Ayanzadeh, Milton Halem and Tim Finin, Solving Hard SAT Instances with Adiabatic Quantum Computers,https://agu.confex.com/agu/fm18/meetingapp.cgi/Paper/438647

Rights

This 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 Union

Subjects

Boolean satisfiability problem (SAT)
heuristics
meta-heuristics
UMBC Ebiquity Research Group

Abstract