234 search results - page 21 / 47 » On the relative complexity of approximate counting problems |
COCO
2003
Springer
14 years 23 days ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
WADS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
CIDR
2003
13 years 9 months ago
2003
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactm...
ECCC
2000
13 years 7 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
CPM
1999
Springer
13 years 11 months 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...