Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty (Q2321284): Difference between revisions

@@ Property / cites work @@
+Temporal constraint networks
@@ Property / cites work: Temporal constraint networks / rank @@
+Normal rank
@@ Property / cites work @@
+On quantified linear implications
@@ Property / cites work: On quantified linear implications / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient execution of dynamically controllable simple temporal networks with uncertainty
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Dynamic Controllability and Dispatchability Relationships
+Normal rank
@@ Property / cites work @@
+Strong Controllability of Disjunctive Temporal Problems with Uncertainty
+Normal rank
@@ Property / cites work @@
+Backtracking algorithms for disjunctions of temporal constraints
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+On a decision procedure for quantified linear programs
+Normal rank
@@ Property / cites work @@
+CTP: A new constraint-based formalism for conditional, temporal planning
+Normal rank
@@ Property / cites work @@
+Handling contingency in temporal constraint networks: from consistency to controllabilities
+Normal rank