Polynomially Bounded Sequences and Polynomial Sequences
Formalized Mathematics · 2015
DOI: 10.1515/forma-2015-0017 ↗Kurz gefasst
Fachartikel in der Zeitschrift Formalized Mathematics, 2015. Verfasst von Hiroyuki Okazaki und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-SA 3.0).
Abstract (Originalsprache)
In this article, we formalize polynomially bounded sequences that plays an important role in computational complexity theory. Class P is a fundamental computational complexity class that contains all polynomial-time decision problems [11], [12]. It takes polynomially bounded amount of computation time to solve polynomial-time decision problems by the deterministic Turing machine. Moreover we formalize polynomial sequences [5].
Zitieren
APA
Okazaki, H., & Futa, Y. (2015). Polynomially Bounded Sequences and Polynomial Sequences. Formalized Mathematics. https://doi.org/10.1515/forma-2015-0017
Vancouver
Okazaki H, Futa Y. Polynomially Bounded Sequences and Polynomial Sequences. Formalized Mathematics. 2015. doi:10.1515/forma-2015-0017
BibTeX
@article{Okazaki2015,
author = {Okazaki, Hiroyuki and Futa, Yuichi},
title = {Polynomially Bounded Sequences and Polynomial Sequences},
journal = {Formalized Mathematics},
year = {2015},
doi = {10.1515/forma-2015-0017}
}
EUVIMED