Published In
Multiple-Valued Logic (ISMVL), 2011 41st IEEE International Symposium on. IEEE, 2011
Document Type
Conference Proceeding
Publication Date
5-2011
Subjects
Computer algorithims, Logic Synthesis, Logic circuits -- Design and construction
Abstract
The Graph Coloring Grover Algorithm has several applications in logic synthesis, scheduling, allocation, planning, robot motion, robot communication, resource allocation, conflict resolution, floor-planning, and many others.
It can serve as a “generic CSP solver” similar to a general SAT solver.
DOI
10.1109/ISMVL.2011.42
Persistent Identifier
http://archives.pdx.edu/ds/psu/12897
Citation Details
Perkowski, Marek and Wang, Yushi, "Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring" (2011). Electrical and Computer Engineering Faculty Publications and Presentations. 204.
http://archives.pdx.edu/ds/psu/12897
Description
This is the author's version of a paper which was subsequently published as ." Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring" Multiple-Valued Logic (ISMVL), 2011 41st IEEE International Symposium on. IEEE, 2011. Version of record can be at http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5954250 Copyright (2011) IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.