Satisfiability Problem Algorithms Analyses by Uwe Schöning (4 results)

Author
Title

Refine your search

  • Books (4)

  • New (4)

to

Custom price range (US$)

to

    • Language: English

      Published by lehmanns media, 2013

      386541527X / 9783865415271

      • Softcover

      Seller: Majestic Books, Hounslow, United KingdomMajestic Books

      4-star seller
      Contact seller

      Condition: New

      US$ 33.03

      US$ 8.64 shipping 
      Ships from United Kingdom to U.S.A.

      Quantity: 1 available

      Condition: New. pp. 184.

    • Language: English

      Published by lehmanns media, 2013

      386541527X / 9783865415271

      • Softcover

      Seller: Books Puddle, New York, NY, U.S.A.Books Puddle

      4-star seller
      Contact seller

      Condition: New

      US$ 41.17

      US$ 3.99 shipping 
      Ships within U.S.A.

      Quantity: 1 available

      Condition: New. pp. 184.

    • More images

      Language: English

      Published by Lehmanns Media Gmbh Jul 2013, 2013

      386541527X / 9783865415271

      • Softcover

      Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

      5-star seller
      Contact seller

      Condition: New

      US$ 23.36

      US$ 76.03 shipping 
      Ships from Germany to U.S.A.

      Quantity: 2 available

      Taschenbuch. Condition: Neu. Neuware - The satisfiability problem of propositional logic, SAT for short, is the first algorithmic problem that was shown to be NP-complete, and is the cornerstone of virtually all NP-completeness proofs. The SAT problem consists of deciding whether a given Boolean formula has a 'solution', in the

    • More images

      Language: English

      Published by Lehmanns Media GmbH, 2013

      386541527X / 9783865415271

      • Softcover

      Seller: preigu, Osnabrück, Germanypreigu

      5-star seller
      Contact seller

      Condition: New

      US$ 23.83

      US$ 79.58 shipping 
      Ships from Germany to U.S.A.

      Quantity: 1 available

      Taschenbuch. Condition: Neu. The Satisfiability Problem | Algorithms and Analyses | Uwe Schöning (u. a.) | Taschenbuch | Mathematik für Anwendungen | 184 S. | Englisch | 2013 | Lehmanns Media GmbH | EAN 9783865415271 | Verantwortliche Person für die EU: Lehmanns Media GmbH, Volker Thurner, Helmholtzstr. 2-9, 10587 Berlin, verlag