scientific article; zbMATH DE number 7310195

zbMath1490.68144MaRDI QIDQ5150565

A. V. Adel'shin, D. I. Yagofarova, Alexander A. Kolokolov

Publication date: 15 February 2021

Full work available at URL: http://mathnet.ru/eng/pdm395

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integer programmingsatisfiability problem\(L\)-class enumerationlogical constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Nonnumerical algorithms (68W05) Computational aspects of satisfiability (68R07)

Cites Work

• Algorithms for the maximum satisfiability problem
• Discrete optimization with logical constraints for design of complex products
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: