1998 search results - page 91 / 400 » Complexity of the Cover Polynomial |
SIAMCOMP
1998
13 years 9 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
CSL
2003
Springer
14 years 3 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...
TAMC
2010
Springer
14 years 3 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 ...
FSE
2000
Springer
14 years 1 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...
VLSID
2005
IEEE
14 years 10 months ago
2005
IEEE
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expre...