Polynomial parametrizations of length 4 Büchi sequences
Xavier Vidaux (2011)
Acta Arithmetica
Similarity:
Xavier Vidaux (2011)
Acta Arithmetica
Similarity:
Hiroyuki Okazaki, Yuichi Futa (2015)
Formalized Mathematics
Similarity:
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].
Barbero, Stefano, Cerruti, Umberto, Murru, Nadir (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
Alkiviadis G. Akritas (1987/88)
Numerische Mathematik
Similarity:
Barbero, Stefano, Cerruti, Umberto, Murru, Nadir (2010)
Journal of Integer Sequences [electronic only]
Similarity:
A. Schinzel (2008)
Acta Arithmetica
Similarity:
Beslin, Scott J. (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity:
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
R. Ger (1971)
Annales Polonici Mathematici
Similarity:
Jason Lucier (2006)
Acta Arithmetica
Similarity:
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
Umberto Zannier (2009)
Acta Arithmetica
Similarity:
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
James P. Jones (1988)
Banach Center Publications
Similarity:
Hans Carstens (1975)
Fundamenta Mathematicae
Similarity:
Akritas, Alkiviadis, Malaschonok, Gennadi, Vigklas, Panagiotis (2014)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): F.2.1, G.1.5, I.1.2. In 1971 using pseudo-divisions - that is, by working in Z[x] - Brown and Traub computed Euclid’s polynomial remainder sequences (prs’s) and (proper) subresultant prs’s using sylvester1, the most widely known form of Sylvester’s matrix, whose determinant defines the resultant of two polynomials. In this paper we use, for the first time in the literature, the Pell-Gordon Theorem of 1917, and sylvester2, a little...