Solving the B-SAT Problem Using Quantum Computing: Smaller is Sometimes BetterEasyChair Preprint 14507, version history
Keyphrases: B-SAT, Boolean Satisfiability Problem, Grover’s Search, closed box testing, conjunctive normal form (CNF), electronic design automation(EDA), quantum computing |