Upper bound on the complexity of solving hard renaming.

Hagit Attiya Armando Castañeda Maurice Herlihy Ami Paz

Published in: PODC (2013)

Keyphrases

upper bound
solving hard
worst case
combinatorial problems
lower bound
search problems
satisfiability problem
branch and bound algorithm
propositional logic
branch and bound
computational complexity
expressive power
propositional satisfiability
space complexity