Results 1  10
of
356,965
Notes on Polynomially Bounded Arithmetic
"... We characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general modeltheoretical investigations on fragments of bounded arithmetic. Contents 0 Introduction and motivation. 1 1 Preliminaries. 3 1.1 The p ..."
Abstract

Cited by 60 (1 self)
 Add to MetaCart
We characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general modeltheoretical investigations on fragments of bounded arithmetic. Contents 0 Introduction and motivation. 1 1 Preliminaries. 3 1
ON POLYNOMIALLY BOUNDED WEIGHTED SHIFTS
"... L(H) the algebra of bounded linear operators on H. An operator T in L(H) is said to be polynomially bounded (notation: T ∈ (PB)) if there exists an M> 0 such that (1) ‖p(T) ‖ ≤M sup{p(ζ)  : ζ  = 1} ∀ polynomial p, and to be power bounded (notation T ∈ (PW)) if (1) holds for every polynomial ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
L(H) the algebra of bounded linear operators on H. An operator T in L(H) is said to be polynomially bounded (notation: T ∈ (PB)) if there exists an M> 0 such that (1) ‖p(T) ‖ ≤M sup{p(ζ)  : ζ  = 1} ∀ polynomial p, and to be power bounded (notation T ∈ (PW)) if (1) holds for every
Polynomially bounded matrix interpretations
 In Proc. 21st RTA, volume 6 of LIPIcs
, 2010
"... Abstract. Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are polynomially bounded. It includes the method of upper triangular interpretations as a special case, and we prove ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are polynomially bounded. It includes the method of upper triangular interpretations as a special case, and we prove
LOCALLY POLYNOMIALLY BOUNDED STRUCTURES
, 2007
"... We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally definable in a fixed ominimal and polynomially bounded reduct. As ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally definable in a fixed ominimal and polynomially bounded reduct
POLYNOMIAL BOUNDS FOR RINGS OF INVARIANTS
, 2000
"... Hilbert proved that invariant rings are finitely generated for linearly reductive groups acting rationally on a finite dimensional vector space. Popov gave an explicit upper bound for the smallest integer d such that the invariants of degree ≤ d generate the invariant ring. This bound has factorial ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
factorial growth. In this paper we will give a bound which depends only polynomially on the input data.
On Boosting with Polynomially Bounded Distributions
 Journal of Machine Learning Research
, 2002
"... We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle's distribution), with minimal performance loss. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle's distribution), with minimal performance loss.
A Polynomial Bound For The Lap Number
, 2001
"... In this note, we show a polynomial bound for the growth of the lap number of a piecewise monotone and piecewise continuous interval map with finitely many periodic points. We use Milnor and Thurston's kneading theory with the coordinates of Baladi and Ruelle, which are useful for extending t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this note, we show a polynomial bound for the growth of the lap number of a piecewise monotone and piecewise continuous interval map with finitely many periodic points. We use Milnor and Thurston's kneading theory with the coordinates of Baladi and Ruelle, which are useful for extending
Results 1  10
of
356,965