FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
In this note we discuss some structural properties of minimum weight (pointed) pseudo-triangulations.
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
This paper deals with distributed control problems by means of distributed games played on Mazurkiewicz traces. The main difference with other notions of distributed games recentl...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
d Abstract) Zhe Dang ¡£¢¤¢ , Oscar H. Ibarra ¥ , Pierluigi San Pietro ¦ , and Gaoyan Xie ¡ § School of Electrical Engineering and Computer Science Washington State Univers...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...