The following pages link to Edith Hemaspaandra (Q293221):
Displayed 34 items.
- (Q4414503) (← links)
- (Q4431234) (← links)
- (Q4501537) (← links)
- (Q4520757) (← links)
- (Q4520804) (← links)
- (Q4536344) (← links)
- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP (Q4571954) (← links)
- Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions (Q4576237) (← links)
- (Q4583938) (← links)
- The Minimization Problem for Boolean Formulas (Q4785629) (← links)
- (Q4833777) (← links)
- SPARSE Reduces Conjunctively to TALLY (Q4852619) (← links)
- (Q4910732) (← links)
- Election Score Can Be Harder than Winner (Q4999207) (← links)
- (Q5005153) (← links)
- (Q5018515) (← links)
- A downward translation in the polynomial hierarchy (Q5048934) (← links)
- Search versus Decision for Election Manipulation Problems (Q5053055) (← links)
- Query optimization using rewrite rules (Q5055765) (← links)
- Query order in the polynomial hierarchy (Q5055937) (← links)
- Finding Optimal Solutions With Neighborly Help. (Q5092442) (← links)
- (Q5133008) (← links)
- A Richer Understanding of the Complexity of Election Systems (Q5192366) (← links)
- Weighted Electoral Control (Q5246710) (← links)
- STACS 2004 (Q5309697) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311105) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311112) (← links)
- Extending Downward Collapse from 1-versus-2 Queries to<i>m</i>-versus-<i>m</i>+ 1 Queries (Q5317200) (← links)
- On the Complexity of Kings (Q5444973) (← links)
- Generalized Modal Satisfiability (Q5449825) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492852) (← links)
- LATIN 2004: Theoretical Informatics (Q5901670) (← links)
- Complexity of Stability. (Q6065416) (← links)
- Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification (Q6160567) (← links)