The following pages link to (Q4385525):
Displaying 50 items.
- On randomized versus deterministic computation (Q1365675) (← links)
- The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
- Query languages for bags and aggregate functions (Q1376407) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- Complexity of some problems in positive and related calculi (Q1401362) (← links)
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (Q1401920) (← links)
- Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- The complexity of belief update (Q1575185) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- On scheduling send-graphs and receive-graphs under the LogP-model (Q1603551) (← links)
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641) (← links)
- On the algorithmic inversion of the discrete Radon transform (Q1603700) (← links)
- A note on unambiguous function classes (Q1607022) (← links)
- Rational analysis, intractability, and the prospects of `as if'-explanations (Q1709129) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Extension and equivalence problems for clause minimal formulae (Q1777408) (← links)
- Minimal temporal epistemic logic (Q1815428) (← links)
- A probabilistic approach to navigation in Hypertext (Q1818980) (← links)
- Complexity results for structure-based causality. (Q1852862) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- An algebra for pomsets. (Q1854275) (← links)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- Functional queries in datalog (Q1862647) (← links)
- Precise interprocedural dependence analysis of parallel programs (Q1884938) (← links)
- Finite-state dimension (Q1884962) (← links)
- A decision method for nonmonotonic reasoning based on autoepistemic reasoning (Q1891263) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- On the geometric separability of Boolean functions (Q1917289) (← links)
- Arity and alternation in second-order logic (Q1919768) (← links)
- The intrinsic difficulty of recursive functions (Q1919986) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Using temporal logics to express search control knowledge for planning (Q1978242) (← links)
- On the decidability and complexity of reasoning about only knowing (Q1978243) (← links)
- Towards efficient universal planning: A randomized approach (Q1978311) (← links)
- The size of a revised knowledge base (Q1978467) (← links)
- On the complexity of inference about probabilistic relational models (Q1978655) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Combining experts' causal judgments (Q2046003) (← links)
- Inconsistency-tolerant query answering for existential rules (Q2124462) (← links)
- On timeline-based games and their complexity (Q2310766) (← links)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting (Q2321294) (← links)
