76 search results - page 6 / 16 » On the Complexity of the Sperner Lemma |
TGC
2010
Springer
13 years 5 months ago
2010
Springer
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
CPM
1999
Springer
14 years 7 days ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
SP
2002
IEEE
13 years 7 months ago
2002
IEEE
When complex systems are constructed from simpler components it is important to know how properties of the components behave under composition. In this article, we present various...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
COCO
2001
Springer
14 years 14 days ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...