On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62043254 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINION / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10601-012-9128-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046346504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of k-Consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry definitions for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429155 / 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: Tetravex is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954175 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:13, 10 July 2024

scientific article
Language Label Description Also known as
English
On the hardness of solving edge matching puzzles as SAT or CSP problems
scientific article

    Statements

    On the hardness of solving edge matching puzzles as SAT or CSP problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 April 2015
    0 references
    constraints
    0 references
    SAT
    0 references
    CSP
    0 references
    edge matching puzzles
    0 references
    puzzles
    0 references
    phase transition
    0 references
    hardness
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references