Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10958-006-0109-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065395241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5550483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials Over Large Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of polynomials over a finite field and the solution of systems of algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of quantifier elimination in the theory of ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of Multivariate Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate Polynomial Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hensel factorization. I / rank
 
Normal rank

Latest revision as of 17:33, 24 June 2024

scientific article
Language Label Description Also known as
English
Theory of computational complexity. Part 9. Transl. from the Russian.
scientific article

    Statements

    Theory of computational complexity. Part 9. Transl. from the Russian. (English)
    0 references
    29 June 2006
    0 references
    The articles of this volume are translations from the series ``Zap. Nauchn. Semin. POMI 316 (2004; Zbl 1065.68003)'' and have been reviewed individually. The preceding collection (8, 2005) has been reviewed (see Zbl 1078.68520 and Zbl 1078.68521).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references