3946 search results - page 467 / 790 » The computational complexity of choice sets |
193
click to vote
ICALP
2007
Springer
16 years 29 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
250
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
183
click to vote
SMA
2008
ACM
15 years 6 months ago
2008
ACM
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
173
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
216
click to vote
SI3D
2005
ACM
16 years 11 days ago
2005
ACM
We present a sampling strategy and rendering framework for intersectable models, whose surface is implicitly defined by a black box intersection test that provides the location a...