Dangos 1 - 3 canlyniadau o 3 ar gyfer chwilio '"NP-complete problem."', amser ymholiad: 0.02e Mireinio'r Canlyniadau
  1. 1

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

    Cyhoeddwyd 1995
    Llyfr

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

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

    Erthygl

    Algorithms for sheet metal nesting.
  3. 3

    A software gan Skliarova, I.

    Erthygl

    A software

Offerynnau Chwilio: