2446 search results - page 246 / 490 » Choiceless Polynomial Time |
153
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
167
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
171
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
172
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
191
click to vote
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
—The use of vital signs as a biometric is a potentially viable approach in a variety of application scenarios such as security and personalized health care. In this paper, a nove...