Search for combinatorial objects using lattice algorithms -- revisited

DOI10.1007/978-3-030-79987-8_2OpenAlexW3174800294MaRDI QIDQ2115837FDOQ2115837

Alfred Wassermann

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_2

zbMATH Keywords

combinatorial searchlattice enumeration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
• A hierarchy of polynomial time lattice basis reduction algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Factoring polynomials with rational coefficients
• Title not available (Why is that?)
• Minkowski's Convex Body Theorem and Integer Programming
• Classification algorithms for codes and designs
• Title not available (Why is that?)
• t-designs on hypergraphs
• New \(t\)-designs and large sets of \(t\)-designs
• Large sets of \(t\)-designs over finite fields
• New large sets of \(t\)-designs
• Constructing two-weight codes with prescribed groups of automorphisms
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new series of large sets of subspace designs over the binary field
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• Large sets of subspace designs
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Solving low-density subset sum problems
• Improved low-density subset sum algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• 2. q-analogs of group divisible designs
• The LLL algorithm. Survey and applications
• Attacking the market split problem with lattice point enumeration
• Title not available (Why is that?)
• Simple \(8\)-designs with small parameters
• Optimal Linear Codes From Matrix Groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• How to Calculate Shortest Vectors in a Lattice
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fourier Analysis of Uniform Random Number Generators
• Title not available (Why is that?)
• An Improved Low-Density Subset Sum Algorithm
• Construction of \((n, r)\)-arcs in \(PG(2, q)\)
• The existence of simple \(6\text{-}(14,7,4)\) designs
• New results on codes with covering radius 1 and minimum distance \(2\)
• Graphical \(t\)-designs via polynomial Kramer-Mesner matrices
• Some new designs with prescribed automorphism groups
• New large sets oft-designs with prescribed groups of automorphisms
• New Upper Bounds on Binary Linear Codes and a $ {\mathbb Z}_{4}$ -Code With a Better-Than-Linear Gray Image
• Title not available (Why is that?)
• New Small 4-Designs with Nonabelian Automorphism Groups

Cited In (3)

• On the classification of unitals on 28 points of low rank
• Improved lattice enumeration algorithms by primal and dual reordering methods
• Higher incidence matrices and tactical decomposition matrices

Uses Software

• CPLEX
• Gurobi
• Cliquer
• DISCRETA
• YIELDS

This page was built for publication: Search for combinatorial objects using lattice algorithms -- revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115837)