Please use this identifier to cite or link to this item: http://dl.pgu.ac.ir/handle/Hannan/9895
Title: Boolean function complexity :;advances and frontiers /;Stasys Jukna.
Authors: Jukn A, St Asys,
Keywords: Computational complexity;Computer Science;Mathematics;Combinatorial analysis
Issue Date: 2012
Publisher: Springer,
place: Berlin ;;London
Series/Report no.: Algorithms and combinatorics ;;27;Algorithms and combinatorics ;;27.
URI: http://dl.pgu.ac.ir/handle/Hannan/9895
ISBN: 9783642245077 (hbk.)
3642245072 (hbk.)
9783642245084 (ebk.)
Format: xv, 615 p. :;ill. ;;24 cm.;Includes bibliographical references and index.
Type Of Material: Book
Appears in Collections:Mathematics

Files in This Item:
File Description SizeFormat 
9783642245077.pdf5.12 MBAdobe PDFThumbnail
Download    Request a copy


Items in HannanDL are protected by copyright, with all rights reserved, unless otherwise indicated.