-
Edith Hemaspaandra (née Spaan, born
February 20, 1964) is a Dutch-American
theoretical computer scientist whose research concerns com****tional social...
- Science. 349 (3): 382–391. doi:10.1016/j.tcs.2005.08.031.
Hemaspaandra, Edith;
Hemaspaandra, Lane A.; Rothe, Jörg (1997). "Exact
Analysis of
Dodgson Elections:...
- That Only
Quantum Computers Will Ever be Able to Solve". 21 June 2018.
Hemaspaandra, Lane (2018). "17.5
Complexity classes". In Rosen,
Kenneth H. (ed.)....
- K.
Thomason Doctoral students Marco Aiello Jeroen Groenendijk Edith Hemaspaandra Michiel van
Lambalgen Maarten de
Rijke Martin Stokhof 1st
Director of...
-
Klinz &
Woeginger (2006); Dorn et al. (2005);
Lipton &
Tarjan (1980).
Hemaspaandra, L. A.; Williams, R. (2012). "SIGACT News
Complexity Theory Column 76"...
-
complete problems. "U".
Complexity Zoo. UP:
Unambiguous Polynomial-Time.
Hemaspaandra, Lane A.; Rothe, Jörg (June 1997). "Unambiguous Com****tion: Boolean...
- CiteSeerX 10.1.1.55.3203. doi:10.1137/S0097539798339041. Zbl 0947.68063.
Hemaspaandra, Lane A.; Ogihara,
Mitsunori (2002). The
complexity theory companion...
- Barak, pp.100
Arora and Barak, pp.100
Arora and Barak, 2009,
Theorem 5.4
Hemaspaandra, Lane (2018). "17.5
Complexity classes". In Rosen,
Kenneth H. (ed.)....
- "Complexity
Theory and Cryptology", by Jörg
Rothe p. 232 Lane A.
Hemaspaandra, "Lowness: a
yardstick for NP-P", ACM
SIGACT News, 1993, vol. 24, no...
- Note that Filmus'
citation in
support of the
claim (Faliszewski, Piotr;
Hemaspaandra, Lane (2009). "The
complexity of power-index comparison". Theoretical...
