467 search results - page 11 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
FOCS
2003
IEEE
14 years 21 days ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
EJC
2010
13 years 7 months ago
2010
Abstract. Motivated by juggling sequences and bubble sort, we examine permutations on the set {1, 2, . . . , n} with d descents and maximum drop size k. We give explicit formulas f...
TCS
2002
13 years 7 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...