Sciweavers

934 search results - page 19 / 187
» Quantum Algorithmic Entropy
Sort
View
CORR
2011
Springer
156views Education» more  CORR 2011»
13 years 2 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
ICALP
2004
Springer
14 years 28 days ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
ICIP
1997
IEEE
14 years 9 months ago
Minimum-Entropy Clustering and its Application to Lossless Image Coding
The Minimum-Entropy Clustering (MEC) algorithm proposed in this paper provides an optimal method for addressing the non-stationarity of a source with respect to entropy coding. Th...
Farshid Golchin, Kuldip K. Paliwal
ICML
2007
IEEE
14 years 8 months ago
Quantum clustering algorithms
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, ...
Esma Aïmeur, Gilles Brassard, Sébastie...
STACS
2005
Springer
14 years 1 months ago
Exact Quantum Algorithms for the Leader Election Problem
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumot...