The following pages link to Hemaspaandra, Lane A. (Q161382):
Displaying 50 items.
- (Q237980) (redirect page) (← links)
- Manipulation complexity of same-system runoff elections (Q314418) (← links)
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- The complexity of controlling candidate-sequential elections (Q526900) (← links)
- (Q584249) (redirect page) (← links)
- The strong exponential hierarchy collapses (Q584250) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- Reducibility classes of P-selective sets (Q672155) (← links)
- Optimal advice (Q672755) (← links)
- P-selectivity: Intersections and indices (Q673115) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Probabilistic polynomial time is closed under parity reductions (Q751270) (← links)
- Kolmogorov characterizations of complexity classes (Q804291) (← links)
- A note on enumerative counting (Q809598) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Generalized juntas and NP-hard sets (Q837194) (← links)
- On the complexity of kings (Q846367) (← links)
- Dichotomy for voting systems (Q859982) (← links)
- Complexity results in graph reconstruction (Q867853) (← links)
- Robust machines accept easy sets (Q914369) (← links)
- On the complexity of ranking (Q920620) (← links)
- Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions (Q935140) (← links)
- Frequency of correctness versus average polynomial time (Q989533) (← links)
- The complexity of power-index comparison (Q1001906) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- Complexity classes without machines: on complete languages for UP (Q1109566) (← links)
- On sparse oracles separating feasible complexity classes (Q1111385) (← links)
- Robust reductions (Q1125798) (← links)
- Separating complexity classes with tally oracles (Q1185002) (← links)
- Polynomial-time compression (Q1198955) (← links)
- Using inductive counting to simulate nondeterministic computation (Q1207953) (← links)
- On checking versus evaluation of multiple queries (Q1260648) (← links)
- Boolean operations, joins, and the extended low hierarchy (Q1275091) (← links)
- Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory (Q1307703) (← links)
- Quasi-injective reductions (Q1314394) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Easy sets and hard certificate schemes (Q1374784) (← links)
- Universally serializable computation (Q1384538) (← links)
- \(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness (Q1387830) (← links)
- P-immune sets with holes lack self-reducibility properties. (Q1401340) (← links)
- (Q1575714) (redirect page) (← links)
- A second step towards complexity-theoretic analogs of Rice's Theorem (Q1575716) (← links)
- Characterizing the existence of one-way permutations (Q1575721) (← links)
- On characterizing the existence of partial one-way permutations (Q1603545) (← links)
- Reducing the number of solutions of NP functions (Q1608321) (← links)
- Recursion-theoretic ranking and compression (Q1713478) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- Enumerative counting is hard (Q1822963) (← links)
