Towards backbone computing: A Greedy-Whitening based approach (Q5145436): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Exact solution of large-scale, asymmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frozen development in graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing backbones of propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing Backbones of Propositional Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Improving MUS Extraction Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank

Revision as of 09:40, 24 July 2024

scientific article; zbMATH DE number 7298902
Language Label Description Also known as
English
Towards backbone computing: A Greedy-Whitening based approach
scientific article; zbMATH DE number 7298902

    Statements

    Towards backbone computing: A Greedy-Whitening based approach (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 January 2021
    0 references
    backbone
    0 references
    satisfiability
    0 references
    approximation
    0 references
    greedy
    0 references
    whitening
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers