8196 search results - page 46 / 1640 » Computational Modeling and Complexity Science |
ICTCS
2003
Springer
15 years 2 months ago
2003
Springer
ICALP
2005
Springer
15 years 3 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...
ICALP
2005
Springer
15 years 3 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...
STACS
2009
Springer
15 years 2 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...