Pages that link to "Item:Q2922601"
From MaRDI portal
The following pages link to On the Complexity of Some Ordering Problems (Q2922601):
Displaying 12 items.
- On the OBDD representation of some graph classes (Q317396) (← links)
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- The query complexity of order-finding (Q596296) (← links)
- Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath (Q832343) (← links)
- The order of Appel's algorithm (Q1186593) (← links)
- Cyclic ordering is NP-complete (Q1248373) (← links)
- The fold complementarity problem and the order complementarity problem (Q1380908) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems (Q2851846) (← links)
- (Q3575467) (← links)
- (Q4250184) (← links)