73 search results - page 8 / 15 » The Strength of Multilinear Proofs |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
115
click to vote
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
In practice, rigid objects often move on a plane. The object then rotates around a fixed axis and translates in a plane orthogonal to this axis. For a concrete example, think of a ...
121
click to vote
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
In practice, rigid objects often move on a plane. The object then rotates around a fixed axis and translates in a plane orthogonal to this axis. For a concrete example, think of a...
115
click to vote
FOCS
1995
IEEE
15 years 3 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
AMAI
2008
Springer
14 years 12 months ago
2008
Springer
Several justification logics have been created, starting with the logic LP, [1]. These can be thought of as explicit versions of modal logics, or of logics of knowledge or belief,...