20294 search results - page 127 / 4059 » Algorithmic Information Theory |
128
click to vote
CAV
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
117
Voted
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
103
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
d Abstract] Christian Borgs Jennifer Chayes Mohammad Mahdian Amin Saberi We propose to use the community structure of Usenet for organizing and retrieving the information stored i...
198
click to vote
Lecture Notes
These lecture notes cover several topics such as Topological Space, Metric Space, Convex Sets, Correspondences, Maximum Theorem, KKM Theorem, Existence of Maximal Element, Selectio...
111
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...