Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case (Q630689): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.camwa.2010.09.059 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016625386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Statistics for Computational Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theories of triangular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative differential operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for solving algebraic systems of positive dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Euclidean algorithm for computing triangular representations of algebraic varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elimination method for polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing polynomial systems into simple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing triangular systems and regular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing triangular decompositions of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic principles of mechanical theorem proving in elementary geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic properties of polynomial rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4303118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square-free algorithms in positive characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416657 / rank
 
Normal rank

Latest revision as of 22:06, 3 July 2024

scientific article
Language Label Description Also known as
English
Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
scientific article

    Statements

    Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2011
    0 references
    0 references
    simple set
    0 references
    finite field
    0 references
    regular set
    0 references
    squarefree decomposition
    0 references
    \(p\)th root extraction
    0 references
    0 references
    0 references
    0 references