Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    A nonlinear lower bound on the practical combinational complexity

    An infinite sequence F={fn} n=1 of one-output Boolean functions with the following three properties is constructed:

      ...

    Xaver Gubáš, Juraj Hromkovič, Juraj Waczulík in STACS 92 (1992)