Search for combinatorial objects using lattice algorithms -- revisited

DOI10.1007/978-3-030-79987-8_2MaRDI QIDQ2115837zbMATH OpenOpenAlexFDO

Authors 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

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

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

Describes a project that uses

Uses Software

• YIELDS
• DISCRETA
• Cliquer
• Gurobi
• CPLEX

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)