IPL
2000
13 years 4 months ago
2000
IPL
2000
13 years 4 months ago
2000
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
IPL
2000
13 years 4 months ago
2000
IPL
2000
13 years 4 months ago
2000
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...
IPL
2000
13 years 4 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
IPL
2000
13 years 4 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
IPL
2000
13 years 4 months ago
2000
Abstract. The mutual exclusion protocol presented ensures that whatever perturbation the network undergo, it regains consistency in nite time: one and only one privilege token is p...
IPL
2000
13 years 4 months ago
2000
Many real life networks, including the World Wide Web, electric power grids, and social networks, are small-world networks. The two distinguishing characteristics of small-world n...
IPL
2000
13 years 4 months ago
2000
IPL
2000
13 years 4 months ago
2000
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environ...