Lower bounds
0 Followers
Most cited papers in Lower bounds
In 1992, A. Hiltgen (Hil92) provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are provably harder to invert than to compute, but the complexity... more
We show that the calculation of the well-known lower bound of Mingozzi for the RCPSP is an NP-hard problem and that the relative error of this lower bound can be equal to O(log n), where n is the number of jobs. 2