1379 search results - page 65 / 276 » The Complexity of the Annihilating Polynomial |
123
Voted
TCS
2010
14 years 11 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
107
click to vote
CSL
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
102
click to vote
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
100
click to vote
FSE
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
103
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...