The following pages link to (Q4385525):
Displayed 50 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- On 2-QBF truth testing in parallel (Q672737) (← links)
- Conjunctive query containment with respect to views and constraints (Q672739) (← links)
- Multilist layering: Complexity and applications (Q673793) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy (Q685431) (← links)
- Deciding uniqueness in norm maximazation (Q687086) (← links)
- A string-matching algorithm for the CREW PRAM (Q688234) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Complexity results for explanations in the structural-model approach (Q814579) (← links)
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- Probabilistic logic under coherence: complexity and algorithms (Q819942) (← links)
- Attribute value reordering for efficient hybrid OLAP (Q855692) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation (Q881802) (← links)
- Magic Sets and their application to data integration (Q882436) (← links)
- Typechecking top-down XML transformations: Fixed input or output schemas (Q937295) (← links)
- Undoing the effects of action sequences (Q946576) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- A refined architecture for terminological systems: Terminology = Schema + Views (Q1128645) (← links)
- State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays (Q1301705) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- Cumulative default logic: Finite characterization, algorithms, and complexity (Q1337685) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Multiple total stable models are definitely needed to solve unique solution problems (Q1349967) (← links)
- On the complexity of partially observed Markov decision processes (Q1351500) (← links)
- On the computational complexity of graph closures (Q1351617) (← links)
- On the language of primitive words (Q1351946) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- The complexity of concept languages (Q1363785) (← links)
- The forbidden projections of unate functions (Q1364471) (← links)
- 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)