Complexity of some polyhedral enumeration problems

By Hans Raj Tiwary. 2008

6 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Tom Diethe
2. Jeremias Knoblauch
3. Hisham Husain

In Computer Graphics and Computer-Aided Design

1. Tom Diethe
2. Jeremias Knoblauch
3. Hisham Husain

Citations in the corpus

• Optimal Continual Learning has Perfect Memory and is NP-hard (2020, methodology): “If S is the set of polytopes, the same conclusion is reached by using the re-sults of Tiwary (2008a) and Tiwary (2008b).”