1450 search results - page 177 / 290 » On the Complexity of Hardness Amplification |
SIAMDM
2008
13 years 9 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
IVS
2007
13 years 9 months ago
2007
Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper n abstract Content-Actor ...
JAIR
2007
13 years 9 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
AIR
2002
13 years 9 months ago
2002
E-commerce sites can have large, essentially unbounded, catalogs. With large catalogs comes increasing difficulty for buyers in making use of standard search and browsing faciliti...
CAD
2004
Springer
13 years 9 months ago
2004
Springer
We present a system, ESOLID, that performs exact boundary evaluation of low-degree curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using e...