Isbn: 9786133708341 - complexity of constraint satisfaction: computational complexity theory, constraint satisfaction, constraint satisfaction problem, np- complete, p (complexity), 2-satisfiability (3 risultati)

Perfeziona la tua ricerca

  • Libri (3)

  • Nuovo (3)

  • Con foto (2)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Omniscriptum Apr 2026, 2026

    6133708344 / 9786133708341

    • Brossura
    • Print on Demand

    Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 116,00

    EUR 23,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 2 disponibili

    Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 72 pp. Englisch.

  • Condizione: Nuovo

    EUR 117,39

    EUR 35,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibile

    Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. The complexity ofconstraint satisfaction is the application of computational complexitytheory on constraint satisfaction. It has mainly been studied fordiscriminating between tractable and intractable classes of constraintsatisfaction problems on finite domains. Solving a constraintsatisfaction problem on a finite domain is an NP-complete problem ingeneral. Research has shown a number of polynomial-time subcases, mostlyobtained by restricting either the allowed domains or constraints or theway constraints can be placed over the variables. Research has alsoestablished relationship of the constraint satisfaction problem withproblems in other areas such as finite model theory and databases.…

  • Lingua: Inglese

    Editore: Omniscriptum Apr 2026, 2026

    6133708344 / 9786133708341

    • Brossura
    • Print on Demand

    Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 116,00

    EUR 60,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibile

    Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. The complexity ofconstraint satisfaction is the application of computational complexitytheory on constraint satisfaction. It has mainly been studied fordiscriminating between tractable and intractable classes of constraintsatisfaction problems on finite domains. Solving a constraintsatisfaction problem on a finite domain is an NP-complete problem ingeneral. Research has shown a number of polynomial-time subcases, mostlyobtained by restricting either the allowed domains or constraints or theway constraints can be placed over the variables. Research has alsoestablished relationship of the constraint satisfaction problem withproblems in other areas such as finite model theory and databasesVDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 72 pp. Englisch.…