ICALP
2007
Springer
14 years 6 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
ICALP
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
ICALP
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
ICALP
2007
Springer
14 years 6 months ago
2007
Springer
ICALP
2007
Springer
14 years 6 months ago
2007
Springer
ICALP
2007
Springer
14 years 6 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
ICALP
2007
Springer
14 years 6 months ago
2007
Springer
ICALP
2007
Springer
14 years 6 months ago
2007
Springer
ICALP
2007
Springer
14 years 6 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
ICALP
2007
Springer
14 years 6 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...