1998 search results - page 305 / 400 » Complexity of the Cover Polynomial |
165
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
192
click to vote
FOCS
2008
IEEE
16 years 28 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 ...
159
click to vote
ISSAC
2007
Springer
16 years 18 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 ...
166
click to vote
FOCS
2006
IEEE
16 years 16 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...
163
click to vote
EUROCRYPT
2005
Springer
16 years 6 hour 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...