The following pages link to (Q4448373):
Displaying 15 items.
- Dualization of Boolean functions using ternary decision diagrams (Q513353) (← links)
- On the complexity of strongly connected components in directed hypergraphs (Q517789) (← links)
- Embedding a state space model into a Markov decision process (Q666503) (← links)
- Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
- A survey on hypergraph products (Q1948609) (← links)
- Primitive tensors and directed hypergraphs (Q2261531) (← links)
- Tropical spectral theory of tensors (Q2349998) (← links)
- Finding the \(K\) best policies in a finite-horizon Markov decision process (Q2433472) (← links)
- Data optimizations for constraint automata (Q2974782) (← links)
- Sequence Hypergraphs (Q3181065) (← links)
- Minimal Disclosure in Hierarchical Hippocratic Databases with Delegation (Q5862674) (← links)
- The complexity of arc-colorings for directed hypergraphs (Q5899364) (← links)
- The complexity of arc-colorings for directed hypergraphs (Q5917590) (← links)
- Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard (Q6121418) (← links)
- Hypergraph analysis based on a compatible tensor product structure (Q6185980) (← links)
