On the computational complexity of the order polynomial
From MaRDI portal
Recommendations
Cites work
- A Brylawski decomposition for finite ordered sets
- Acyclic orientations of graphs
- Combinatorial theory.
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Measurement Theory
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Ordered structures and partitions
- Searching in Trees, Series-Parallel and Interval Orders
- Single Machine Scheduling with Precedence Constraints of Dimension 2
- Some Colouring Problems and their Complexity
- The complexity of computing the permanent
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
Cited in
(7)- Cross-series-parallel digraphs
- Many order types on integer grids of polynomial size
- An algebra over the operad of posets and structural binomial identities
- Doppelgangers: the ur-operation and posets of bounded height (extended abstract)
- scientific article; zbMATH DE number 4027523 (Why is no real title available?)
- scientific article; zbMATH DE number 14735 (Why is no real title available?)
- Query order in the polynomial hierarchy
This page was built for publication: On the computational complexity of the order polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086595)