P66: Enumeration of all arrangements

P66: Enumeration of all arrangements

Input:

An integer $n$ and $\mathcal{J} \subseteq \{+, -\}^n$.

Output:

The set $\mathcal{F}$ of faces if $\mathcal{J}$ is the set of maximal faces of an oriented matroid

Complexity:

$O(\max(n^2 |\mathcal{J}|^3, n^3 |\mathcal{J}|^2))$ total time.

Comment:

Their paper treats a reconstruction of the location vectors of all faces from the graph.

Reference:

[Fukuda1991] (Bibtex)