This work is focused into constructing mathematical structure. This structure is closed under it's operations. Structure was developed to contain all functions of certain growth rate. To be More specific functi- ons with polynomial growth rate. We can say that our structure con- tains all functions that have growth rate slower or equal to polynomial growth rate and no other function. Development of our structure was influenced mostly by work of Samuel R. Buss [1]
We focus on the BSS model of computation over arbitrary structures. We provide new completeness resu...
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally pro...
AbstractThe functions of Computable Analysis are defined by enhancing the capacities of normal Turin...
This thesis focuses on machine-free definition of polynomial functions. The main goal is to not only...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
[1955]. It is based on a discrete mechanical framework that can be used to model computation over th...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
Polynomially bounded DOL systems are investigated. Necessary and sufficient conditions on the set of...
AbstractA strong connection is established between the structural and the looking back techniques fo...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
International audienceThe class of functions from the integers to the integers computable in polynom...
AbstractTownsend introduced a resource-bounded extension of polynomial-time computable functions on ...
Abstract. In this paper, we study computability and complexity of real functions. We extend these no...
In this paper, a special angular measure of functions ’ asymptotic growth is offered, which allows o...
It is shown for any constant c<1, that if NPMV have refinements in the class of multivalued function...
We focus on the BSS model of computation over arbitrary structures. We provide new completeness resu...
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally pro...
AbstractThe functions of Computable Analysis are defined by enhancing the capacities of normal Turin...
This thesis focuses on machine-free definition of polynomial functions. The main goal is to not only...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
[1955]. It is based on a discrete mechanical framework that can be used to model computation over th...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
Polynomially bounded DOL systems are investigated. Necessary and sufficient conditions on the set of...
AbstractA strong connection is established between the structural and the looking back techniques fo...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
International audienceThe class of functions from the integers to the integers computable in polynom...
AbstractTownsend introduced a resource-bounded extension of polynomial-time computable functions on ...
Abstract. In this paper, we study computability and complexity of real functions. We extend these no...
In this paper, a special angular measure of functions ’ asymptotic growth is offered, which allows o...
It is shown for any constant c<1, that if NPMV have refinements in the class of multivalued function...
We focus on the BSS model of computation over arbitrary structures. We provide new completeness resu...
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally pro...
AbstractThe functions of Computable Analysis are defined by enhancing the capacities of normal Turin...