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

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