976 search results - page 21 / 196 » The Complexity of Timetable Construction Problems |
CAIP
2003
Springer
13 years 12 months ago
2003
Springer
The problem of independence and completeness of rotation moment invariants is addressed in this paper. General method for constructing invariants of arbitrary orders by means of co...
CRYPTO
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
JCP
2007
13 years 6 months ago
2007
Abstract— This paper presents i-AA1 , a constructive, incremental learning algorithm for a special class of weightless, self-organizing networks. In i-AA1 , learning consists of ...
ICALP
2005
Springer
14 years 8 days 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
14 years 8 days 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...