681 search results - page 6 / 137 » General Polynomial Time Decomposition Algorithms |
68
Voted
SOCO
2002
Springer
14 years 9 months ago
2002
Springer
In this article, we develop a new method and an algorithm to solve a system of fuzzy relation equations. We first introduce a solution-base-matrix and then give a tractable mathema...
128
click to vote
ISTCS
1997
Springer
15 years 1 months ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
74
Voted
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
89
Voted
ESA
2008
Springer
14 years 11 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
82
Voted
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...