2446 search results - page 122 / 490 » Choiceless Polynomial Time |
194
click to vote
CODCRY
2011
Springer
14 years 4 months ago
2011
Springer
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
93
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
116
click to vote
MDM
2004
Springer
15 years 6 months ago
2004
Springer
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be iden...