Black November: Store besparelser hele måneden Vi fejrer Black Friday hele november måned med store besparelser
Udvidet returret til d. 31. januar 2025
Hjælp
Login
  1. Forside
  2. Bøger
  3. Business og læring
  4. Computer og IT
  5. Computational Complexity of Solving Equation Systems

Computational Complexity of Solving Equation Systems - Przemyslaw Broniek - Bog

af Przemyslaw Broniek

indgår i SpringerBriefs in Philosophy serien

Computational Complexity of Solving Equation Systems af Przemyslaw Broniek
Bag om Computational Complexity of Solving Equation Systems

Since unary algebras admit only type 1, this book focuses on these algebras to tackle the main problem. It discusses several aspects of unary algebras and proves that the Constraint Satisfaction Problem for relational structures is polynomially equivalent to SysTermSat over unary algebras.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9783319217499
  • Indbinding:
  • Paperback
  • Sideantal:
  • 64
  • Udgivet:
  • 5. august 2015
  • Udgave:
  • 12015
  • Størrelse:
  • 155x235x4 mm.
  • Vægt:
  • 1299 g.
  • 8-11 hverdage.
  • 27. november 2024
På lager

Normalpris

  • BLACK NOVEMBER

Medlemspris

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Bag om Przemyslaw Broniek

Vis alle bøger af Przemyslaw Broniek

Beskrivelse af Computational Complexity of Solving Equation Systems

Since unary algebras admit only type 1, this book focuses on these algebras to tackle the main problem. It discusses several aspects of unary algebras and proves that the Constraint Satisfaction Problem for relational structures is polynomially equivalent to SysTermSat over unary algebras.

Brugerbedømmelser af Computational Complexity of Solving Equation Systems



Andre købte også..
Find lignende bøger
Bogen Computational Complexity of Solving Equation Systems findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.