Skip to main content
Have a personal or library account? Click to login
Polynomially Bounded Sequences and Polynomial Sequences Cover

Polynomially Bounded Sequences and Polynomial Sequences

Formalized Mathematics
Volume 23 (2015): Issue 3 (September 2015)
By:  and    
Open Access
|Sep 2015
References

References

  1. [1] Grzegorz Bancerek. The fundamental properties of natural numbers., 1(1):41-46, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. The ordinal numbers., 1(1):91-96, 1990.
    Search in Google Scholar
  3. [3] Grzegorz Bancerek. Increasing and continuous ordinal sequences., 1(4):711-714, 1990.
    Search in Google Scholar
  4. [4] Grzegorz Bancerek and Piotr Rudnicki. Two programs for SCM. Part I - preliminaries., 4(1):69-72, 1993.
    Search in Google Scholar
  5. [5] E.J. Barbeau. Polynomials. Springer, 2003.
    Search in Google Scholar
  6. [6] Czesław Bylinski. The complex numbers., 1(3):507-513, 1990.
    Search in Google Scholar
  7. [7] Czesław Bylinski. Functions and their basic properties., 1(1): 55-65, 1990.
    Search in Google Scholar
  8. [8] Czesław Bylinski. Functions from a set to a set., 1(1):153-164, 1990.
    Search in Google Scholar
  9. [9] Czesław Bylinski. Some basic properties of sets., 1(1):47-53, 1990.
    Search in Google Scholar
  10. [10] Agata Darmochwał. Finite sets., 1(1):165-167, 1990.
    Search in Google Scholar
  11. [11] Jon Kleinberg and Eva Tardos. Algorithm Design. Addison-Wesley, 2005.
    Search in Google Scholar
  12. [12] Donald E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms, Third Edition. Addison-Wesley, 1997.
    Search in Google Scholar
  13. [13] Artur Korniłowicz. On the real valued functions., 13(1):181-187, 2005.
    Search in Google Scholar
  14. [14] Jarosław Kotowicz. The limit of a real function at infinity., 2 (1):17-28, 1991.
    Search in Google Scholar
  15. [15] Jarosław Kotowicz. Real sequences and basic operations on them., 1(2):269-272, 1990.
    Search in Google Scholar
  16. [16] Richard Krueger, Piotr Rudnicki, and Paul Shelley. Asymptotic notation. Part I: Theory., 9(1):135-142, 2001.
    Search in Google Scholar
  17. [17] Richard Krueger, Piotr Rudnicki, and Paul Shelley. Asymptotic notation. Part II: Examples and problems., 9(1):143-154, 2001.
    Search in Google Scholar
  18. [18] Yatsuka Nakamura and Hisashi Ito. Basic properties and concept of selected subsequence of zero based finite sequences., 16(3):283-288, 2008. doi:10.2478/v10037-008-0034-y.
    Open DOISearch in Google Scholar
  19. [19] Jan Popiołek. Some properties of functions modul and signum., 1(2):263-264, 1990.
    Search in Google Scholar
  20. [20] Konrad Raczkowski and Andrzej Nedzusiak. Real exponents and logarithms., 2(2):213-216, 1991.
    Search in Google Scholar
  21. [21] Konrad Raczkowski and Andrzej Nedzusiak. Series., 2(4):449-452, 1991.
    Search in Google Scholar
  22. [22] Konrad Raczkowski and Paweł Sadowski. Real function differentiability., 1(4):797-801, 1990.
    Search in Google Scholar
  23. [23] Yasunari Shidama. The Taylor expansions., 12(2):195-200, 2004.
    Search in Google Scholar
  24. [24] Michał J. Trybulec. Integers., 1(3):501-505, 1990.
    Search in Google Scholar
  25. [25] Zinaida Trybulec. Properties of subsets., 1(1):67-71, 1990.
    Search in Google Scholar
  26. [26] Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences., 9(4):825-829, 2001.
    Search in Google Scholar
  27. [27] Edmund Woronowicz. Relations and their basic properties., 1 (1):73-83, 1990.
    Search in Google Scholar
  28. [28] Edmund Woronowicz. Relations defined on sets., 1(1):181-186, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.1515/forma-2015-0017 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 205 - 213
Submitted on: Jun 30, 2015
Published on: Sep 30, 2015
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Keywords:
computational complexity,
polynomial time
MSC:
03D15,
68Q15,
03B35
MML:
ASYMPT 2
Related subjects:
Computer sciences,
Artificial intelligence,
Computer sciences, other,
Mathematics,
Logic and set theory,
General mathematics

© 2015 Hiroyuki Okazaki, Yuichi Futa, published by University of Białystok
This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 License.

Volume 23 (2015): Issue 3 (September 2015)
Previous article
Next article