Search found 1 match

Go to advanced search

by DanDan
03 Jan 2023, 18:25
Forum: Helpdesk
Topic: Computational Complexity of VERTICES_IN_FACETS
Replies: 3
Views: 8385

Re: Computational Complexity of VERTICES_IN_FACETS

Thanks a lot for the answer. Ok, so for fixed dimension d, assuming the resulting polytope to be simplicial (with prob 1) is indeed crucial for the algorithms to run in linear time? Otherwise, we do have to stick with the general case of exponential time? May I ask to suggest a paper that I can refe...

Go to advanced search