Pages that link to "Item:Q3780763"
From MaRDI portal
The following pages link to Minkowski's Convex Body Theorem and Integer Programming (Q3780763):
Displaying 50 items.
- Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
- Building large \(k\)-cores from sparse graphs (Q2678255) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- The cutting plane method is polynomial for perfect matchings (Q2800362) (← links)
- Algorithms for Controlling Palletizers (Q2806926) (← links)
- Capital Budgeting Problems: A Parameterized Point of View (Q2806927) (← links)
- Parallel Implementation of BDD Enumeration for LWE (Q2822698) (← links)
- A Multivariate Approach for Checking Resiliency in Access Control (Q2830068) (← links)
- Slide reduction, successive minima and several~applications (Q2872006) (← links)
- Tensor-based hardness of the shortest vector problem to within almost polynomial factors (Q2913824) (← links)
- A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
- An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints (Q2958349) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
- Harmonious Coloring: Parameterized Algorithms and Upper Bounds (Q3181062) (← links)
- Recovering zeros of polynomials modulo a prime (Q3189458) (← links)
- On the Efficacy of Solving LWE by Reduction to Unique-SVP (Q3193270) (← links)
- An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem (Q3297526) (← links)
- The complexity of speedrunning video games (Q3301017) (← links)
- Closing the Gap for Makespan Scheduling via Sparsification Techniques (Q3387928) (← links)
- About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
- Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm (Q3454866) (← links)
- Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation (Q3511182) (← links)
- Covering minima and lattice point free convex bodies (Q3757974) (← links)
- Block Reduced Lattice Bases and Successive Minima (Q4325334) (← links)
- Local Testing of Lattices (Q4565131) (← links)
- Predicting nonlinear pseudorandom number generators (Q4671848) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
- Faster Algorithms for Integer Programs with Block Structure (Q5002724) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590) (← links)
- Meta-heuristic approaches to solve shortest lattice vector problem (Q5035010) (← links)
- About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
- The Integrality Number of an Integer Program (Q5041756) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Enumerating Integer Points in Polytopes with Bounded Subdeterminants (Q5062109) (← links)
- (Q5089202) (← links)
- On Integer Programming and Convolution. (Q5090420) (← links)
- (Q5090421) (← links)
- (Q5090494) (← links)
