Pages that link to "Item:Q1893737"

The following pages link to The complexity of selecting maximal solutions (Q1893737):

Displaying 24 items.

• On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
• Generating all maximal models of a Boolean expression (Q294760) (← links)
• Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
• Trichotomies in the complexity of minimal inference (Q692908) (← links)
• Counting minimal unsatisfiable subsets (Q832272) (← links)
• On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
• Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964) (← links)
• The computational complexity of maximization and integration (Q1057267) (← links)
• Semantical and computational aspects of Horn approximations (Q1575175) (← links)
• Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
• Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)
• Max NP-completeness made easy (Q1960655) (← links)
• Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
• (Q3745325) (← links)
• Complexity results for some eigenvector problems (Q4521209) (← links)
• The operators min and max on the polynomial hierarchy (Q5047162) (← links)
• The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
• Finding similar/diverse solutions in answer set programming (Q5298797) (← links)
• Introduction to the Maximum Solution Problem (Q5504706) (← links)
• The Max-Atom Problem and Its Relevance (Q5505542) (← links)
• Witnesses for Answer Sets of Logic Programs (Q5886522) (← links)
• Tractability of explaining classifier decisions (Q6098842) (← links)
• Contrastive explanations for answer-set programs (Q6545521) (← links)
• Hashing-based approximate counting of minimal unsatisfiable subsets (Q6632194) (← links)