Showing 1 - 2 results of 2 for search '"Complexity of proof procedures."', Forespørselstid: 0.02s Refine Results
  1. 1

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

    Udgivet i Journal of the ACM
    Article

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

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

    Udgivet i Journal of the ACM
    Article

    On sufficient conditions for unsatisfiability of random formulas.

Søgeredskaber: