Polynomial time algorithms for sentences over number fields
From MaRDI portal
Publication:1187032
DOI10.1016/0890-5401(92)90037-GzbMath0761.03006OpenAlexW2038598785MaRDI QIDQ1187032
Publication date: 28 June 1992
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(92)90037-g
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Computational complexity of sentences over fields ⋮ Sentences over integral domains and their computational complexities
Cites Work
- Unnamed Item
- Unnamed Item
- Solvability by radicals is in polynomial time
- Factoring polynomials with rational coefficients
- Complexity of Sentences over Number Rings
- The Undecidability of Algebraic Rings and Fields
- Factoring Polynomials over Algebraic Number Fields
- Provability and Decidability of Arithmetical Universal-Existential Sentences
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Computational complexities of diophantine equations with parameters
- An Inequality About Factors of Polynomials
- Decidable fragments of field theories
- THE UNDECIDABILITY OF PURE TRANSCENDENTAL EXTENSIONS OF REAL FIELDS
- Definability and decision problems in arithmetic
This page was built for publication: Polynomial time algorithms for sentences over number fields
