Linear programming over exponent pairs (Q4981721): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PARI/GP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060601688 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.1993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Computing Optimal Exponent Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3834133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential sums and the Riemann zeta function v / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Sums and the Riemann Zeta Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an asymmetric divisor problem with congruence conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Sums and the Riemann Zeta-Function II / rank
 
Normal rank

Latest revision as of 15:48, 8 July 2024

scientific article; zbMATH DE number 6308191
Language Label Description Also known as
English
Linear programming over exponent pairs
scientific article; zbMATH DE number 6308191

    Statements

    Linear programming over exponent pairs (English)
    0 references
    0 references
    24 June 2014
    0 references
    bounds for exponential sums
    0 references
    exponent pairs
    0 references
    linear programming
    0 references
    divisors problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references