1 - 2 toradh á dtaispeáint as 2 toradh san iomlán ar an gcuardach '"Complexity of proof procedures."', am iarratais: 0.52s Beachtaigh na torthaí
  1. 1

    Resolution lower bounds for the weak pigeonhole principle. de réir Raz, R.

    Foilsithe in Journal of the ACM
    Alt

    Resolution lower bounds for the weak pigeonhole principle.
  2. 2

    On sufficient conditions for unsatisfiability of random formulas. de réir Atserias, Albert

    Foilsithe in Journal of the ACM
    Alt

    On sufficient conditions for unsatisfiability of random formulas.

Uirlisí cuardaigh: