1379 search results - page 203 / 276 » The Complexity of the Annihilating Polynomial |
150
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
188
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
157
click to vote
APPROX
2009
Springer
16 years 26 days ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
161
click to vote
WINE
2009
Springer
16 years 26 days 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...
182
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 ...