Computational complexity of sentences over fields
type: Item
instance of: scholarly article
title: Computational complexity of sentences over fields
zbMATH Open document ID: 1154.68434
author: B. E. Eshmatov
published in: Information and Computation
publication date: 2008-08-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 5312286
zbMATH Keywords: arithmetical sentences
zbMATH Keywords: computational complexity
zbMATH Keywords: fields
MaRDI profile type: Publication
full work available at URL: j.ic.2008.04.001
OpenAlex ID: W2088407853
cites work: Q4773298
cites work: The elementary theory of finite fields
cites work: Diophantine Problems Over Local Fields I
cites work: Diophantine problems over local fields. III: Decidable fields
cites work: Q4050665
cites work: Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
cites work: Q4747509
cites work: Q5531082
cites work: Q3027108
cites work: Solving diophantine problems over all residue class fields of a number field and all finite fields
cites work: Irreducibility of multivariate polynomials
cites work: Q4406533
cites work: Metamathematical Considerations On The Relative Irreducibility Of Polynomials
cites work: Factoring sparse multivariate polynomials
cites work: Factorization of polynomials over a finite field and the solution of systems of algebraic equations
cites work: Q3912021
cites work: Generalized riemann hypothesis and factoring polynomials over finite fields
cites work: Q4771385
cites work: Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
cites work: Effective Hilbert irreducibility
cites work: Fast parallel absolute irreducibility testing
cites work: Factoring Polynomials over Algebraic Number Fields
cites work: Solvability by radicals is in polynomial time
cites work: Q3309989
cites work: Factoring multivariate polynomials over finite fields
cites work: Factoring Multivariate Polynomials over Algebraic Number Fields
cites work: Factoring polynomials with rational coefficients
cites work: Factoring integers with elliptic curves
cites work: Q4252162
cites work: Q4252163
cites work: Q3915990
cites work: On definable subsets of p-adic fields
cites work: Q5518490
cites work: Q5586197
cites work: Q3808150
cites work: Definability and decision problems in arithmetic
cites work: The Undecidability of Algebraic Rings and Fields
cites work: THE UNDECIDABILITY OF PURE TRANSCENDENTAL EXTENSIONS OF REAL FIELDS
cites work: Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
cites work: Q3325808
cites work: Q3947744
cites work: Q5792485
cites work: Provability and Decidability of Arithmetical Universal-Existential Sentences
cites work: Computational complexities of diophantine equations with parameters
cites work: Decidable fragments of field theories
cites work: Polynomial time algorithms for sentences over number fields
cites work: Computational complexity of arithmetical sentences
cites work: Sentences over integral domains and their computational complexities
DOI: 10.1016/J.IC.2008.04.001
description: scientific article; zbMATH DE number 5312286