Randomized algorithms over finite fields for the exact parity base problem. (Q1578505): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1006/jcom.1999.0522 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965574700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distinguishing prime numbers from composite numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact arborescences, matchings and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On prime numbers in an arithmetic progression with a prime-power difference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random pseudo-polynomial algorithms for exact matroid problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of pfaffians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:36, 30 May 2024

scientific article
Language Label Description Also known as
English
Randomized algorithms over finite fields for the exact parity base problem.
scientific article

    Statements

    Randomized algorithms over finite fields for the exact parity base problem. (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    randomized algorithms
    0 references
    matroids
    0 references
    exact problems
    0 references
    0 references