Partition problems in high dimensional boxes (Q2000653): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128169269, #quickstatements; #temporary_batch_1722547657812
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1805.11278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partitions of discrete boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal partitions of a box into boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite algebras of finite complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyboxes, cube tilings and rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing the complete \(r\)-graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kleitman and combinatorics / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128169269 / rank
 
Normal rank

Latest revision as of 22:30, 1 August 2024

scientific article
Language Label Description Also known as
English
Partition problems in high dimensional boxes
scientific article

    Statements

    Partition problems in high dimensional boxes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 2019
    0 references
    partition problems
    0 references
    high dimensional boxes
    0 references
    linear programming
    0 references

    Identifiers

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