Erakusten 1 - 3 emaitzak -- 3 bilaketa honetara '"NP-complete problem."', Bilaketaren denbora: 0,01s Findu emaitzak
  1. 1

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

    Argitaratua 1995
    Liburua

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

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

    Artikulua

    Algorithms for sheet metal nesting.
  3. 3

    A software nork Skliarova, I.

    Argitaratua izan da IEEE Transactions on VLSI systems
    Artikulua

    A software

Bilaketa egiteko lanabesak: