(Q51640567)

English

Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions.

scientific article published on 19 September 2002

Statements

Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions (English)

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit