De Aller-Bedste Bøger - over 12 mio. danske og engelske bøger
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

- 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:
  • 9783642245077
  • Indbinding:
  • Hardback
  • Sideantal:
  • 620
  • Udgivet:
  • 6. januar 2012
  • Størrelse:
  • 165x242x39 mm.
  • Vægt:
  • 1076 g.
  • Ukendt - mangler pt..

Normalpris

Abonnementspris

- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding

Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.

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: