1383 search results - page 206 / 277 » On the Complexity of the Interlace Polynomial |
183
click to vote
FOCS
2008
IEEE
16 years 22 days ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
155
click to vote
ISSAC
2007
Springer
16 years 13 days ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
159
click to vote
FOCS
2006
IEEE
16 years 10 days ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
159
click to vote
EUROCRYPT
2005
Springer
15 years 11 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...
186
click to vote
FLOPS
2004
Springer
15 years 11 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 ...