976 search results - page 24 / 196 » The Complexity of Timetable Construction Problems |
ICALP
2007
Springer
14 years 1 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...
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
TCS
2002
13 years 7 months ago
2002
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
INFORMATICALT
2007
13 years 7 months ago
2007
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...