ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM (Q5151087): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2915739729 / 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
Property / cites work
 
Property / cites work: On approximation algorithms for the minimum satisfiability problem / rank
 
Normal rank
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: ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH / rank
 
Normal rank

Latest revision as of 15:20, 24 July 2024

scientific article; zbMATH DE number 7311446
Language Label Description Also known as
English
ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
scientific article; zbMATH DE number 7311446

    Statements