On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Gautam K. Das / rank
Normal rank
 
Property / author
 
Property / author: Gautam K. Das / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: C4.5 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimal convex nested polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruence, similarity, and symmetries of geometric objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3327527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for polytope covering and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex hulls for polyhedral domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast detection of polyhedral intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum polygonal separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing optimal binary decision trees is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of loading shallow neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the smallest triangles containing a given convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of polyhedral separability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4089424 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0925-7721(97)00006-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010348345 / rank
 
Normal rank

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
scientific article

    Statements

    On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (English)
    0 references
    0 references
    0 references
    9 November 1997
    0 references
    3-dimensional convex polyhedra
    0 references
    decision trees
    0 references

    Identifiers