W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/4895Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Okazaki, Hiroyuki | pl |
| dc.contributor.author | Futa, Yuichi | pl |
| dc.date.accessioned | 2016-12-16T10:10:18Z | - |
| dc.date.available | 2016-12-16T10:10:18Z | - |
| dc.date.issued | 2015 | pl |
| dc.identifier.citation | Formalized Mathematics, Volume 23, Issue 3, 205–213 | pl |
| dc.identifier.issn | 1426-2630 | pl |
| dc.identifier.issn | 1898-9934 | pl |
| dc.identifier.uri | http://hdl.handle.net/11320/4895 | - |
| dc.description.abstract | AbstractIn 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]. | pl |
| dc.language.iso | en | pl |
| dc.publisher | De Gruyter Open | pl |
| dc.subject | computational complexity | pl |
| dc.subject | polynomial time | pl |
| dc.title | Polynomially Bounded Sequences and Polynomial Sequences | pl |
| dc.type | Article | pl |
| dc.identifier.doi | 10.1515/forma-2015-0017 | pl |
| dc.description.Affiliation | Hiroyuki Okazaki - Shinshu University, Nagano, Japan | pl |
| dc.description.Affiliation | Yuichi Futa - Japan Advanced Institute of Science and Technology, Ishikawa, Japan | pl |
| dc.description.references | Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990. | pl |
| dc.description.references | Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990. | pl |
| dc.description.references | Grzegorz Bancerek. Increasing and continuous ordinal sequences. Formalized Mathematics, 1(4):711-714, 1990. | pl |
| dc.description.references | Grzegorz Bancerek and Piotr Rudnicki. Two programs for SCM. Part I - preliminaries. Formalized Mathematics, 4(1):69-72, 1993. | pl |
| dc.description.references | E.J. Barbeau. Polynomials. Springer, 2003. | pl |
| dc.description.references | Czesław Bylinski. The complex numbers. Formalized Mathematics, 1(3):507-513, 1990. | pl |
| dc.description.references | Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990. | pl |
| dc.description.references | Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990. | pl |
| dc.description.references | Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990. | pl |
| dc.description.references | Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990. | pl |
| dc.description.references | Jon Kleinberg and Eva Tardos. Algorithm Design. Addison-Wesley, 2005. | pl |
| dc.description.references | Donald E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms, Third Edition. Addison-Wesley, 1997. | pl |
| dc.description.references | Artur Korniłowicz. On the real valued functions. Formalized Mathematics, 13(1):181-187, 2005. | pl |
| dc.description.references | Jarosław Kotowicz. The limit of a real function at infinity. Formalized Mathematics, 2 (1):17-28, 1991. | pl |
| dc.description.references | Jarosław Kotowicz. Real sequences and basic operations on them. Formalized Mathematics, 1(2):269-272, 1990. | pl |
| dc.description.references | Richard Krueger, Piotr Rudnicki, and Paul Shelley. Asymptotic notation. Part I: Theory. Formalized Mathematics, 9(1):135-142, 2001. | pl |
| dc.description.references | Richard Krueger, Piotr Rudnicki, and Paul Shelley. Asymptotic notation. Part II: Examples and problems. Formalized Mathematics, 9(1):143-154, 2001. | pl |
| dc.description.references | Yatsuka Nakamura and Hisashi Ito. Basic properties and concept of selected subsequence of zero based finite sequences. Formalized Mathematics, 16(3):283-288, 2008. doi:10.2478/v10037-008-0034-y. [Crossref] | pl |
| dc.description.references | Jan Popiołek. Some properties of functions modul and signum. Formalized Mathematics, 1(2):263-264, 1990. | pl |
| dc.description.references | Konrad Raczkowski and Andrzej Nedzusiak. Real exponents and logarithms. Formalized Mathematics, 2(2):213-216, 1991. | pl |
| dc.description.references | Konrad Raczkowski and Andrzej Nedzusiak. Series. Formalized Mathematics, 2(4):449-452, 1991. | pl |
| dc.description.references | Konrad Raczkowski and Paweł Sadowski. Real function differentiability. Formalized Mathematics, 1(4):797-801, 1990. | pl |
| dc.description.references | Yasunari Shidama. The Taylor expansions. Formalized Mathematics, 12(2):195-200, 2004. | pl |
| dc.description.references | Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990. | pl |
| dc.description.references | Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990. | pl |
| dc.description.references | Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825-829, 2001. | pl |
| dc.description.references | Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990. | pl |
| dc.description.references | Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990. | pl |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2015, Volume 23, Issue 3 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| forma-2015-0017.pdf | 269,56 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
