On the efficiency of convex polyhedra (Q2130564): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.entcs.2018.03.004 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: HyTech / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PAGAI / 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.1016/j.entcs.2018.03.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2797788337 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113317576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Abstract Domain of Parallelotopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient constraint/generator removal from double description of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not necessarily closed convex polyhedra and the double description method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity recognition of the union of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for discovering the set of all the solutions of a linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The octahedron abstract domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational Abstract Domain of Weighted Hexagons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logahedra: A New Weakly Relational Domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Inversion Join for Polyhedral Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Variables per Linear Inequality as an Abstract Domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polyhedra abstract domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENTCS.2018.03.004 / rank
 
Normal rank

Latest revision as of 04:24, 17 December 2024

scientific article
Language Label Description Also known as
English
On the efficiency of convex polyhedra
scientific article

    Statements

    On the efficiency of convex polyhedra (English)
    0 references
    0 references
    25 April 2022
    0 references
    convex polyhedra
    0 references
    domain wrappers
    0 references
    double description
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers