Almost tight bounds for eliminating depth cycles in three dimensions (Q1745206): Difference between revisions

← Older edit

@@ description / en / description / en @@
+scientific article; zbMATH DE number 6784055
@@ Property / zbMATH Open document ID @@
+.68120
@@ Property / zbMATH Open document ID: 1375.68120 / rank @@
+Normal rank
@@ Property / DOI @@
+.1145/2897518.2897539
@@ Property / DOI: 10.1145/2897518.2897539 / rank @@
+Normal rank
@@ Property / published in @@
+Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
+Normal rank
@@ Property / publication date @@
+September 2017Timestamp +2017-09-29T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2017-09-29T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 29 September 2017 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6784055
@@ Property / zbMATH DE Number: 6784055 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational geometry
@@ Property / zbMATH Keywords: computational geometry / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lines in space
@@ Property / zbMATH Keywords: lines in space / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+painter's algorithm
@@ Property / zbMATH Keywords: painter's algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial partitioning
@@ Property / zbMATH Keywords: polynomial partitioning / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2267359946
@@ Property / OpenAlex ID: W2267359946 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1745206