Efficiency lower bounds for commit-and-prove constructions.

Christian Badertscher Sandro Coretti Chen-Da Liu Zhang Ueli Maurer

Published in: ISIT (2017)

Keyphrases

lower bound
upper bound
data sets
worst case
branch and bound algorithm
branch and bound
objective function
computational complexity
upper and lower bounds
information systems
website
np hard
high efficiency
lower bounding
randomized algorithm