Searching for authors named "Edith Hemaspaandra" – sorted by Relevance.
-
Computational Politics: Electoral Systems
- Computational Politics: Electoral Systems Edith Hemaspaandra Department of Computer Science
- Cited by 5 (1 self) – Add To MetaCart
-
SPARSE reduces conjunctively to TALLY
- SPARSE reduces conjunctively to TALLY Harry Buhrman Edith Hemaspaandra y Luc Longpr'e z
- Cited by 20 (4 self) – Add To MetaCart
-
Equivalence Problems for Boolean Constraint Satisfaction
- urzburg Equivalence Problems for Boolean Constraint Satisfaction Elmar Bohler y Edith Hemaspaandra z Steffen
- Cited by 5 (2 self) – Add To MetaCart
-
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- Hybrid Elections Broaden Complexity- Theoretic Resistance to Control 1 Edith Hemaspaandra, Lane A
- Cited by 3 (2 self) – Add To MetaCart
-
Query Order in the Polynomial Hierarchy
- Query Order in the Polynomial Hierarchy Edith Hemaspaandra y Lane A. Hemaspaandra z Harald
- Cited by 9 (6 self) – Add To MetaCart
-
R SN 1-tt (NP) distinguishes robust many-one and Turing completeness
- Completeness Edith Hemaspaandra ∗ Department of Mathematics Le Moyne College Syracuse, NY 13214, USA Lane A
- Cited by 6 (3 self) – Add To MetaCart
-
Raising NP Lower Bounds to Parallel NP Lower Bounds
- Raising NP Lower Bounds to Parallel NP Lower Bounds Edith Hemaspaandra y Lane A. Hemaspaandra
- Cited by 6 (5 self) – Add To MetaCart
-
Almost-Everywhere Superiority for Quantum Polynomial-Time Languages
- Almost-Everywhere Superiority for Quantum Polynomial-Time Languages Edith Hemaspaandra y Lane A
- Cited by 4 (0 self) – Add To MetaCart
-
Downward Collapse from a Weaker Hypothesis
- Downward Collapse from a Weaker Hypothesis Edith Hemaspaandra Department of Computer Science
- Cited by 1 (1 self) – Add To MetaCart
-
A Downward Collapse Within The Polynomial Hierarchy
- A DOWNWARD COLLAPSE WITHIN THE POLYNOMIAL HIERARCHY # EDITH HEMASPAANDRA + , LANE A. HEMASPAANDRA
- Cited by 23 (8 self) – Add To MetaCart

