2446 search results - page 24 / 490 » Choiceless Polynomial Time |
141
click to vote
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
118
click to vote
ARITH
2007
IEEE
15 years 10 months ago
2007
IEEE
The compensated Horner algorithm improves the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic: the computed result is as accurate as if it was computed wi...
127
click to vote
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
142
click to vote
JOC
2007
15 years 3 months ago
2007
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
103
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...