Pages that link to "Item:Q4285633"
From MaRDI portal
The following pages link to Complexity and algorithms for reasoning about time (Q4285633):
Displayed 29 items.
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure (Q543614) (← links)
- Biorders with frontier (Q633220) (← links)
- The complexity of querying indefinite data about linearly ordered domains (Q676427) (← links)
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class (Q679419) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- Complexity classification in qualitative temporal constraint reasoning (Q814637) (← links)
- A unifying approach to temporal constraint reasoning (Q1274294) (← links)
- A complete classification of tractability in Allen's algebra relative to subsets of basic relations (Q1277697) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- On point-based temporal disjointness (Q1342229) (← links)
- Simultaneous representation of interval and interval-containment orders (Q1362579) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- Twenty-one large tractable subclasses of Allen's algebra (Q1402726) (← links)
- Reasoning about causality between distributed nonatomic events (Q1402743) (← links)
- A comparison of point-based approaches to qualitative temporal reasoning (Q1606329) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Solving multi-granularity temporal constraint networks (Q1614864) (← links)
- Numerical representation of \(PQI\) interval orders (Q1766750) (← links)
- Proof of the interval satisfiability conjecture (Q1924736) (← links)
- Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
- Modelling and solving temporal reasoning as propositional satisfiability (Q2389682) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class (Q2457656) (← links)
- Planning temporal events using point-interval logic (Q2473196) (← links)
- Shiftable intervals (Q2480206) (← links)
- Unique Perfect Phylogeny Is NP-Hard (Q3011849) (← links)
- Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure (Q3523065) (← links)
- On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)