681 search results - page 16 / 137 » General Polynomial Time Decomposition Algorithms |
160
Voted
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
179
Voted
SPAA
2005
ACM
15 years 12 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
206
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
An RNA molecule is structured on several layers. The primary and most obvious structure is its sequence of bases, i.e. a word over the alphabet {A, C, G, U}. The higher structure i...
154
Voted
IJCAI
2003
15 years 7 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
177
Voted
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...