Boolean Function Complexity

Advances and Frontiers

af Stasys Jukna

Bog, Hardback, Engelsk, 2012

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.

Sammenlign priser Se bogdetaljer

Priser fra 4 boghandlere

BoghandlerPrisFragtLevering
SAXO864,95 kr.Gratis fragtUkendtKøb for 864,95 kr.Køb
Bogreolen938,95 kr.0,00 kr.Ukendt - mangler pt.Køb for 938,95 kr.Køb
Tales939,95 kr.34,95 kr.Ukendt - mangler pt.Køb for 939,95 kr.Køb
Pling BØGER939,95 kr.34,95 kr.Ukendt - mangler pt.Køb for 939,95 kr.Køb

Bogdetaljer

SprogEngelsk
IndbindingHardback
ISBN9783642245077
Udgivet6/01/2012
Udgivet afSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
Længde620 sider
ForfatterStasys Jukna
GenreBusiness og læring, Computer og IT