Showing 1 - 2 results of 2 for search '"Complexity of proof procedures."', tempo de consulta: 0.01s Limitar resultados
  1. 1

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

    Publicado en Journal of the ACM
    Artigo

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

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

    Publicado en Journal of the ACM
    Artigo

    On sufficient conditions for unsatisfiability of random formulas.

Ferramentas de procura: