Name: Boolean Function Complexity
Price: 738.95 DKK
Availability: InStock
Author: Stasys Jukna
ISBN: 9783642431449

Boolean Function Complexity af Stasys Jukna

Du sparer 0% ift. normalprisen Spar 0%

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

Forlag:
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG

Indbinding:
Paperback

Sideantal:
620

Udgivet:
22. februar 2014

Udgave:
2012

Størrelse:
155x235x36 mm.

Vægt:
961 g.

Leveringstid: 2-3 uger.
Forventet levering: 22. november 2024

På lager

Normalpris

BLACK NOVEMBER
738,95 kr. + Fragt
~~738,95 kr.~~

Medlemspris

688,95 kr.

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:

Business og læring > Computer og IT

Boolean Function Complexity - Stasys Jukna - Bog

Bag om Stasys Jukna

Beskrivelse af Boolean Function Complexity

Brugerbedømmelser af Boolean Function Complexity

Gør som tusindvis af andre bogelskere