1383 search results - page 206 / 277 » On the Complexity of the Interlace Polynomial |
128
click to vote
FOCS
2008
IEEE
15 years 8 months 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 ...
112
click to vote
ISSAC
2007
Springer
15 years 8 months 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 ...
112
click to vote
FOCS
2006
IEEE
15 years 8 months 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...
117
click to vote
EUROCRYPT
2005
Springer
15 years 7 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...
133
click to vote
FLOPS
2004
Springer
15 years 7 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 ...