68 search results - page 8 / 14 » stoc 2004 |
STOC
2004
ACM
15 years 10 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
ECCC
2008
14 years 10 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
PKC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free version of the Ajtai-Dwork cryptosystem by Goldreich, Goldwass...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...