Sciweavers

152 search results - page 9 / 31
» Robust Polynomials and Quantum Algorithms
Sort
View
STACS
2010
Springer
14 years 3 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall
ICANN
2005
Springer
14 years 1 months ago
Robust Structural Modeling and Outlier Detection with GMDH-Type Polynomial Neural Networks
Abstract. The paper presents a new version of a GMDH type algorithm able to perform an automatic model structure synthesis, robust model parameter estimation and model validation i...
Tatyana I. Aksenova, Vladimir Volkovich, Alessandr...
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
14 years 3 months ago
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
Shengyu Zhang
ISNN
2009
Springer
14 years 3 months ago
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
Zhihui Xing, Haibin Duan, Chunfang Xu
FOCS
2009
IEEE
14 years 3 months ago
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
Daniel Gottesman, Sandy Irani