2638 search results - page 27 / 528 » Random Geometric Complexes |
102
click to vote
CSL
2004
Springer
15 years 7 months ago
2004
Springer
By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formul...
126
click to vote
COCO
2004
Springer
15 years 7 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
123
click to vote
ISVC
2007
Springer
15 years 8 months ago
2007
Springer
Surveillance systems that operate continuously generate large volumes of data. One such system is described here, continuously tracking and storing observations taken from multiple...
137
click to vote
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
107
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...