Pages that link to "Item:Q1107524"

The following pages link to More complicated questions about maxima and minima, and some closures of NP (Q1107524):

Displaying 41 items.

• Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
• Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
• The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
• On the equivalence of distributed systems with queries and communication (Q389221) (← links)
• The computational complexity of weak saddles (Q647484) (← links)
• \(\text{DA}^2\) merging operators (Q814605) (← links)
• The complexity of Kemeny elections (Q817813) (← links)
• Probabilistic logic under coherence: complexity and algorithms (Q819942) (← links)
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
• On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
• Exact complexity of exact-four-colorability (Q1014384) (← links)
• On truth-table reducibility to SAT (Q1173957) (← links)
• Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
• The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
• Logical foundations of information disclosure in ontology-based data integration (Q1711879) (← links)
• Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
• Complexity results for structure-based causality. (Q1852862) (← links)
• Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
• Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
• Controlling weighted voting games by deleting or adding players with or without changing the quota (Q2169970) (← links)
• Complexity of stability (Q2237893) (← links)
• Isomorphic implication (Q2272203) (← links)
• Query evaluation on a database given by a random graph (Q2272222) (← links)
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
• Efficient timed model checking for discrete-time systems (Q2368994) (← links)
• Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
• A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
• A note on parallel queries and the symmetric-difference hierarchy. (Q2583533) (← links)
• The complexity of online manipulation of sequential elections (Q2637642) (← links)
• Manipulation in communication structures of graph-restricted weighted voting games (Q2695440) (← links)
• Inconsistency-Tolerant Querying of Description Logic Knowledge Bases (Q2970304) (← links)
• Deciding According to the Shortest Computations (Q3091456) (← links)
• Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
• Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
• The operators min and max on the polynomial hierarchy (Q5047162) (← links)
• The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
• Finding Optimal Solutions With Neighborly Help. (Q5092442) (← links)
• Complexity of Stability. (Q6065416) (← links)
• Toward credible belief base revision (Q6088376) (← links)
• Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
• Taking into account ``who said what'' in abstract argumentation: complexity results (Q6161469) (← links)