2957 search results - page 141 / 592 » The Complexity of Polynomial-Time Approximation |
162
click to vote
KI
2007
Springer
15 years 11 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
139
Voted
EUROCRYPT
2005
Springer
15 years 10 months ago
2005
Springer
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
165
Voted
FLOPS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
168
Voted
MOBICOM
2003
ACM
15 years 10 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
142
click to vote
EUROCRYPT
2003
Springer
15 years 10 months ago
2003
Springer
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...