9842 search results - page 240 / 1969 » The Complexity of the Matching-Cut Problem |
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
100
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
88
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
106
click to vote
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
111
click to vote
CP
1998
Springer
15 years 4 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...