Mostrar 1 - 3 resultats de 3 per cerca '"NP-complete problem."', hora de la petició: 0.02sec Refinar resultats
  1. 1

    Efficient checking of polynomials and proofs and the hardness of approximation problems per Sudan, Madhu

    Publicat 1995
    Llibre

    Efficient checking of polynomials and proofs and the hardness of approximation problems
  2. 2

    Algorithms for sheet metal nesting. per Herrmann, J.W

    Article

    Algorithms for sheet metal nesting.
  3. 3

    A software per Skliarova, I.

    Article

    A software

Eines de cerca: