Lower bounds for linear degeneracy testing
From MaRDI portal
Publication:5901076
DOI10.1145/1007352.1007436zbMath1192.68306OpenAlexW2091720561MaRDI QIDQ5901076
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.1190
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Lower bounds for linear degeneracy testing
