The following pages link to Edith Hemaspaandra (Q293221):
Displayed 50 items.
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
- Manipulation complexity of same-system runoff elections (Q314418) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- The complexity of controlling candidate-sequential elections (Q526900) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- On the complexity of kings (Q846367) (← links)
- Dichotomy for voting systems (Q859982) (← links)
- Complexity results in graph reconstruction (Q867853) (← links)
- Generalized modal satisfiability (Q988571) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- Item:Q293221 (redirect page) (← links)
- The relative power of logspace and polynomial time reductions (Q1312179) (← links)
- A modal perspective on the computational complexity of attribute value grammar (Q1314274) (← links)
- Quasi-injective reductions (Q1314394) (← links)
- Census techniques collapse space classes (Q1332770) (← links)
- Item:Q293221 (redirect page) (← links)
- \(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness (Q1387830) (← links)
- The price of universality (Q1815426) (← links)
- \(p\)-Selective sets and reducing search to decision vs. self-reducibility (Q1816728) (← links)
- Almost-everywhere superiority for quantum polynomial time (Q1854537) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- Complexity of stability (Q2237893) (← links)
- Isomorphic implication (Q2272203) (← links)
- All superlinear inverse schemes are coNP-hard (Q2575753) (← links)
- The complexity of online manipulation of sequential elections (Q2637642) (← links)
- (Q2753683) (← links)
- The Complexity of Poor Man's Logic (Q2761753) (← links)
- Computational Aspects of Approval Voting (Q2829683) (← links)
- Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates (Q2941740) (← links)
- (Q2957899) (← links)
- Multimode Control Attacks on Elections (Q3081454) (← links)
- A Universally Defined Undecidable Unimodal Logic (Q3088054) (← 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)
- Complexity of Manipulative Actions When Voting with Ties (Q3449525) (← links)
- More Natural Models of Electoral Control by Partition (Q3449546) (← links)
- (Q3457231) (← links)
- (Q3457243) (← links)
- Copeland Voting Fully Resists Constructive Control (Q3511426) (← links)
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control (Q3651465) (← links)
- How Hard Is Bribery in Elections? (Q3651470) (← links)
- (Q4035688) (← links)
- Exact analysis of Dodgson elections (Q4208875) (← links)
- A Downward Collapse within the Polynomial Hierarchy (Q4210153) (← links)
- (Q4251058) (← links)
- (Q4281494) (← links)
- (Q4366882) (← links)
- (Q4411838) (← links)