1998 search results - page 65 / 400 » Complexity of the Cover Polynomial |
EUROCRYPT
2009
Springer
14 years 10 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
PPSC
1997
13 years 11 months ago
1997
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...
FCT
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
CADE
2008
Springer
13 years 12 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...