534 search results - page 32 / 107 » Efficient polynomial L-approximations |
AOR
2006
13 years 7 months ago
2006
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
MASCOTS
2001
13 years 9 months ago
2001
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...