Pages that link to "Item:Q2643564"

The following pages link to Effective lattice point counting in rational convex polytopes (Q2643564):

Displaying 28 items.

• (Q3384159) (← links)
• Ehrhart Polynomials and Successive Minima (Q3410735) (← links)
• Computing points of bounded height in projective space over a number field (Q3450044) (← links)
• Short rational generating functions for lattice point problems (Q4419572) (← links)
• Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
• (Q5021002) (← links)
• Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws (Q5050755) (← links)
• Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox (Q5053688) (← links)
• Exploring the No-Show Paradox for Condorcet Extensions (Q5053695) (← links)
• IAC Probability Calculations in Voting Theory: Progress Report (Q5053701) (← links)
• A chaotic lattice field theory in one dimension* (Q5054696) (← links)
• Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration (Q5119842) (← links)
• Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
• Graded Betti numbers of good filtrations (Q5146991) (← links)
• Volume Computation for Boolean Combination of Linear Arithmetic Constraints (Q5191119) (← links)
• Computing topological zeta functions of groups, algebras, and modules, I (Q5252087) (← links)
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection (Q5387636) (← links)
• Computing the Ehrhart quasi-polynomial of a rational simplex (Q5470061) (← links)
• Computing algebraic numbers of bounded height (Q5501149) (← links)
• Petri Net Reductions for Counting Markings (Q5883572) (← links)
• Multi-collinear splitting kernels for track function evolution (Q6055792) (← links)
• Computing Galois groups of Ehrhart polynomials in OSCAR (Q6103866) (← links)
• On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
• Enhancing SMT-based weighted model integration by structure awareness (Q6494358) (← links)
• A combinatorial approach to Frobenius numbers of some special sequences (Q6564067) (← links)
• Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates (Q6578650) (← links)
• Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
• Counting the integer points of parametric polytopes: a Maple implementation (Q6660327) (← links)