Stem hardest$ (all stems)
4 papers:
- ICALP-v1-2015-KurpiszLM #on the #problem
- On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy (AK, SL, MM), pp. 872–885.
- STOC-2007-Austrin #satisfiability
- Balanced max 2-sat might not be the hardest (PA), pp. 189–197.
- ESOP-2004-Hansen
- A Hardest Attacker for Leaking References (RRH), pp. 310–324.
- LICS-1997-Vorobyov #decidability
- The “Hardest” Natural Decidable Theory (SGV), pp. 294–305.