Separability of the characteristic polynomial
W. Głocki (1987)
Applicationes Mathematicae
Similarity:
Displaying similar documents to “Dividing the polynomial expressions based on the criteria of reducing the number of computational operations.”
Separability of the characteristic polynomial
Polynomially Bounded Sequences and Polynomial Sequences
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].
On the number of terms of a composite polynomial
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
A generalization of a polynomial lemma of Leja
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
On some properties of polynomial functions
R. Ger (1971)
Annales Polonici Mathematici
Similarity:
Intersective sets given by a polynomial
Jason Lucier (2006)
Acta Arithmetica
Similarity:
Explicit constructions of extractors and expanders
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
A formula for the supersingular polynomial
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
Near solutions of polynomial equations
Shih Ping Tung (2006)
Acta Arithmetica
Similarity:
Existence of Polynomial Solutions of a Class of Riccati-Type Differential Equations.
H. Kaufman, Mira Bhargava (1965)
Collectanea Mathematica
Similarity:
Degrees of Polynomial Solutions of a Class of Riccati - tipe Differential Equations*.
Mira Bhargava (1964)
Collectanea Mathematica
Similarity:
The reduced length of a polynomial with complex coefficients
A. Schinzel (2008)
Acta Arithmetica
Similarity:
Elementary properties of the class of nondeterministic polynomial time computable functions
James P. Jones (1988)
Banach Center Publications
Similarity:
The intrinsic complexity of parametric elimination methods.
Heintz, J., Matera, G., Pardo, L.M., Wachenchauzer, R. (1998)
Electronic Journal of SADIO [electronic only]
Similarity:
The complete polynomial grid
R. V. Parker (1973)
Matematički Vesnik
Similarity: