1672 search results - page 207 / 335 » Tightness problems in the plane |
102
click to vote
JMMA
2002
14 years 10 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
106
click to vote
FSTTCS
2009
Springer
15 years 5 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
TCC
2007
Springer
15 years 5 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
FOCS
2004
IEEE
15 years 2 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
176
click to vote
AOSD
2010
ACM
15 years 6 months ago
2010
ACM
Advice is a mechanism, widely used in aspect-oriented languages, that allows one program component to augment or modify the behavior of other components. When advice and other com...