Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration (Q5119842): Difference between revisions

From MaRDI portal
Changed an 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 / OpenAlex ID
 
Property / OpenAlex ID: W2991080885 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1807.05348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer points in polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting lattice points by means of the residue theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Continuous Discretely / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for exact satisfiability and number of perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3095368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residue formulae, vector partition functions and lattice points in rational polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster exponential-time algorithms in graphs of bounded average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective lattice point counting in rational convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and Integer Programming vs Linear Integration and Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Counting Integral Points in a Convex Rational Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Alternative Algorithm for Counting Lattice Points in a Convex Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exponentially Convergent Trapezoidal Rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank

Latest revision as of 09:53, 23 July 2024

scientific article; zbMATH DE number 7242690
Language Label Description Also known as
English
Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration
scientific article; zbMATH DE number 7242690

    Statements

    Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration (English)
    0 references
    0 references
    0 references
    0 references
    1 September 2020
    0 references
    integer points in polytopes
    0 references
    counting algorithm
    0 references
    \(Z\)-transformation
    0 references
    numerical integration
    0 references
    trapezoidal rule
    0 references

    Identifiers

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