2446 search results - page 24 / 490 » Choiceless Polynomial Time |
STOC
2005
ACM
14 years 1 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...
ARITH
2007
IEEE
14 years 1 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...
ICCV
2007
IEEE
14 years 1 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...
JOC
2007
13 years 7 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...
ICALP
2010
Springer
14 years 10 days 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 ...