(Q7977975)

English

weak NP-completeness

set of computational problems for which there is an algorithm solving them in polynomial time in the dimension of the problem and the magnitudes of the data involved (if given as integers), rather than the base-two logarithms of their magnitudes

  • weakly NP-complete

Statements

0 references
0 references
 
edit
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit