Results 1 
3 of
3
2006, Quantum verification of matrix products
 Proceedings of the 17th ACMSIAM Symposium on Discrete Algorithms
"... We present a quantum algorithm that verifies a product of two n×n matrices over any integral domain with bounded error in worstcase time O(n 5/3) and expected time O(n 5/3 / min(w, √ n) 1/3), where w is the number of wrong entries. This improves the previous best algorithm [ABH + 02] that runs in ..."
Abstract

Cited by 48 (0 self)
 Add to MetaCart
We present a quantum algorithm that verifies a product of two n×n matrices over any integral domain with bounded error in worstcase time O(n 5/3) and expected time O(n 5/3 / min(w, √ n) 1/3), where w is the number of wrong entries. This improves the previous best algorithm [ABH + 02] that runs
Approximating Quadratic Programs with Positive Semidefinite Constraints
"... We describe a polynomial time approximation algorithm to the problem of maximizing a quadratic form subject to quadratic constraints specified by PSD matrices. A special case, that has applications for clustering [CW04], is optimizing quadratic forms over the unit cube. Approximation algorithms with ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We describe a polynomial time approximation algorithm to the problem of maximizing a quadratic form subject to quadratic constraints specified by PSD matrices. A special case, that has applications for clustering [CW04], is optimizing quadratic forms over the unit cube. Approximation algorithms
NorthHolland S INGLE AND MULT ISTEP ITERAT IVE IMAGE RESTORATION AND VLS I IMPLEMENTATION
, 1988
"... Abstract. A synchronous VLSI implementation f an iterative image restoration algorithm is described in this paper. This implementation is based on a singlestep, aswell as on a multistep iterative algorithm derived from the singlestep regularized iterative restoration algorithm. One processor is as ..."
Abstract
 Add to MetaCart
Abstract. A synchronous VLSI implementation f an iterative image restoration algorithm is described in this paper. This implementation is based on a singlestep, aswell as on a multistep iterative algorithm derived from the singlestep regularized iterative restoration algorithm. One processor