876 search results - page 7 / 176 » New Results for the Martin Polynomial |
SIAMCO
2000
13 years 8 months ago
2000
The aim of this paper is to present a new approach to the filtering problem for the class of bilinear stochastic multivariable systems, consisting in searching for suboptimal state...
ESSLLI
2009
Springer
13 years 6 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
FOSSACS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
TOC
2010
13 years 3 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
COMBINATORICS
2000
13 years 8 months ago
2000
: We prove two extensions of the Hales-Jewett coloring theorem. The first is a polynomial version of a finitary case of Furstenberg and Katznelson's multiparameter elaboration...