The following pages link to (Q4385525):
Displaying 50 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- Revisiting a result of Ko (Q286990) (← links)
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- Restricted default theories: expressive power and outlier detection tasks (Q483301) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← 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)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- The complexity of one-agent refinement modal logic (Q744988) (← 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)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← 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)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← 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 survey on the complexity of tournament solutions (Q1042317) (← links)
- On the complexity of Slater's problems (Q1043351) (← links)
- The computational complexity of ideal semantics (Q1045987) (← 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)
