The following pages link to (Q4472458):
Displayed 8 items.
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation (Q714500) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Dichotomy for voting systems (Q859982) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)