Vi bøger
Trustpilot
Levering: 1 - 2 hverdage
Hjælp
Login
  1. Forside
  2. Bøger
  3. Business og læring
  4. Computer og IT
  5. Boolean Function Complexity

Boolean Function Complexity - Stasys Jukna - Bog

- Advances and Frontiers

af Stasys Jukna

indgår i Algorithms and Combinatorics serien

Boolean Function Complexity af Stasys Jukna
Bag om Boolean Function Complexity

Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9783642431449
  • Indbinding:
  • Paperback
  • Sideantal:
  • 620
  • Udgivet:
  • 22. februar 2014
  • Udgave:
  • 2012
  • Størrelse:
  • 155x235x36 mm.
  • Vægt:
  • 961 g.
  • 1-2 uger.
  • 15. januar 2025
På lager

Normalpris

Medlemspris

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

Bag om Stasys Jukna

Vis alle bøger af Stasys Jukna

Beskrivelse af Boolean Function Complexity

Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science.

Brugerbedømmelser af Boolean Function Complexity



Andre købte også..
Find lignende bøger
Bogen Boolean Function Complexity 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.