Erakusten 1 - 2 emaitzak -- 2 bilaketa honetara '"Complexity of proof procedures."', Bilaketaren denbora: 0,02s Findu emaitzak
  1. 1

    Resolution lower bounds for the weak pigeonhole principle. nork Raz, R.

    Argitaratua izan da Journal of the ACM
    Artikulua

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

    On sufficient conditions for unsatisfiability of random formulas. nork Atserias, Albert

    Argitaratua izan da Journal of the ACM
    Artikulua

    On sufficient conditions for unsatisfiability of random formulas.

Bilaketa egiteko lanabesak: