Sciweavers

Share
8 search results - page 1 / 2
» Improved output-sensitive quantum algorithms for Boolean mat...
Sort
View
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
7 years 3 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall
ICDT
2009
ACM
129views Database» more  ICDT 2009»
10 years 2 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh
SIAMSC
2010
143views more  SIAMSC 2010»
8 years 12 months ago
Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromod
Abstract. We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive deļ¬nite matrix while solving a linear system of equations with Conjugate G...
Andreas Stathopoulos, Konstantinos Orginos
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
10 years 1 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
9 years 7 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
books