ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH (Q5150716): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4375757 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3639756 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4415205 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4852854 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Investigation of maximum and minimum satisfiability problems using \(L\)-partition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard / rank | |||
Normal rank | |||
Latest revision as of 13:47, 24 July 2024
scientific article; zbMATH DE number 7310323
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH |
scientific article; zbMATH DE number 7310323 |
Statements
ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH (English)
0 references
15 February 2021
0 references
satisfiability problem
0 references
logical constraints
0 references
integer programming
0 references
\(L\)-partition
0 references
