Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the hardness of minkowski addition and related operations
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Listing vertices of simple polyhedra associated with dual LI (2) systems
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
A Metric for Quantifying Similarity between Timing Constraint Sets in Real-Time Systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.02 |