467 search results - page 22 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
134
click to vote
COCO
2000
Springer
15 years 4 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
113
click to vote
CC
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
RTA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
CADE
2008
Springer
15 years 1 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...
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, based on a careful investigation on the calibration (downsample) technique, we improve two detectors for detecting LSB matching: Calibrated HCF COM and Calibrated A...