Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes (Q1274552): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3723487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardest constraint problems: A double phase transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of Origami world / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of recognizing polyhedral scenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of constraint satisfaction revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some pitfalls for experimenters with random SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of labeling perspective projections of polyhedral scenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating hard satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic approach to shape-from-image problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting the deep structure of constraint problems / rank
 
Normal rank

Revision as of 16:56, 28 May 2024

scientific article
Language Label Description Also known as
English
Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes
scientific article

    Statements

    Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 January 1999
    0 references
    line drawings
    0 references
    computational complexity
    0 references
    random polyhedral scenes
    0 references

    Identifiers