612 search results - page 39 / 123 » Hardness assumptions in the foundations of theoretical compu... |
TLCA
2005
Springer
14 years 1 months ago
2005
Springer
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
COMPGEOM
2010
ACM
14 years 25 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
GI
2009
Springer
14 years 11 days ago
2009
Springer
: Out-of-Home (OOH) advertising is currently advancing into a new era: “pervasive advertising” is one of the buzz words describing a soft change from the traditional push-only ...
SWAT
1998
Springer
13 years 12 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds dia...