2000 |
14 | EE | Nicolas J. Cerf,
Lov K. Grover,
Colin P. Williams:
Nested Quantum Search and NP-Hard Problems.
Appl. Algebra Eng. Commun. Comput. 10(4/5): 311-338 (2000) |
13 | EE | Richard J. Hughes,
Colin P. Williams:
Quantum Computing: The Final Frontier?
IEEE Intelligent Systems 15(5): 10-18 (2000) |
1998 |
12 | | Colin P. Williams:
Quantum Computing and Quantum Communications, First NASA International Conference, QCQC'98, Palm Springs, California, USA, February 17-20, 1998, Selected Papers
Springer 1998 |
11 | EE | Amir Fijany,
Colin P. Williams:
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits.
QCQC 1998: 10-33 |
10 | EE | Colin P. Williams,
Alexander G. Gray:
Automated Design of Quantum Circuits.
QCQC 1998: 113-125 |
9 | EE | Michail Zak,
Colin P. Williams:
Quantum Recurrent Networks for Simulating Stochastic Processes.
QCQC 1998: 75-88 |
1996 |
8 | EE | Tad Hogg,
Bernardo A. Huberman,
Colin P. Williams:
Phase Transitions and the Search Problem.
Artif. Intell. 81(1-2): 1-15 (1996) |
1994 |
7 | | Tad Hogg,
Colin P. Williams:
Expected Gains from Parallelizing Constraint Solving for Hard Problems.
AAAI 1994: 331-336 |
6 | | Tad Hogg,
Colin P. Williams:
The Hardest Constraint Problems: A Double Phase Transition.
Artif. Intell. 69(1-2): 359-377 (1994) |
5 | | Colin P. Williams,
Tad Hogg:
Exploiting the Deep Structure of Constraint Problems.
Artif. Intell. 70(1-2): 73-117 (1994) |
1993 |
4 | | Colin P. Williams,
Tad Hogg:
Extending Deep Structure.
AAAI 1993: 152-157 |
3 | | Tad Hogg,
Colin P. Williams:
Solving the Really Hard Problems with Cooperative Search.
AAAI 1993: 231-236 |
2 | | Colin P. Williams,
Tad Hogg:
The Typicality of Phase Transitions in Search.
Computational Intelligence 9: 221-238 (1993) |
1992 |
1 | | Colin P. Williams,
Tad Hogg:
Using Deep Structure to Locate Hard Problems.
AAAI 1992: 472-477 |