An edition of Boolean Function Complexity Advances And Frontiers
(2012)
Boolean Function Complexity Advances And Frontiers
by Stasys Jukna
Share
×Close
This edition doesn't have a description yet. Can you add one?
Publish Date
2012
Publisher
Springer
Check nearby libraries
Buy this book
Subjects
Computational complexity, Algebra, boolean, Computer science, Mathematics, Combinatorial analysis, Berechnungskomplexität, Beweissystem, Binäres Entscheidungsdiagramm, Boolesche Funktion, Schaltfunktion, Information theory, Combinatorics, Circuits Information and Communication, Theory of Computation, Mathematics of Computing| Edition | Availability |
|---|---|
1
|
aaaa
|
Book Details
Classifications
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
See All
History
- Created October 14, 2016
- 4 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| December 12, 2022 | Edited by MARC Bot | import existing book |
| October 4, 2021 | Edited by ImportBot | import existing book |
| October 14, 2016 | Edited by Mek | Added new cover |
| October 14, 2016 | Created by Mek | Added new book. |