1998 search results - page 305 / 400 » Complexity of the Cover Polynomial |
106
click to vote
WINE
2009
Springer
15 years 7 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...
119
click to vote
FOCS
2008
IEEE
15 years 7 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 ...
102
Voted
ISSAC
2007
Springer
15 years 6 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 ...
101
click to vote
FOCS
2006
IEEE
15 years 6 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...
101
Voted
EUROCRYPT
2005
Springer
15 years 6 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...