"The complexity of boolean functions" - similar Books and Chapters

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
The complexity of boolean functions	Wegener I.	1991	Wiley
Boolean Function Complexity	M. S. Paterson	1992-11	Cambridge University Press
Analysis of Boolean Functions	Ryan O'Donnell	2014-06	Cambridge University Press
TheComplexity of Boolean Functions	Ingo Wegener	1987	Wiley
Progress in Applications of Boolean Functions	Tsutomu Sasao; Jon Butler		Springer International Publishing
Progress in applications of Boolean functions	Tsutomu Sasao; Jon T. Butler	2010	Morgan & Claypool Publishers
Boolean Functions - Topics in Asynchronicity	Serban E. Vlad	2019	John Wiley & Sons
Boolean Functions and Computation Models	Peter Clote; Evangelos Kranakis	2002	Springer Berlin Heidelberg
Cryptographic Boolean Functions and Applications	Thomas W. Cusick and Pantelimon Stănică	2009	Academic Press
Cardinal Functions on Boolean Algebras	J. Donald Monk	1990	Birkhäuser Basel
Boolean Function Complexity: Advances and Frontiers	Stasys Jukna	2012	Springer Berlin Heidelberg
Noise Sensitivity of Boolean Functions and Percolation	Christophe Garban; Jeffrey E. Steif	2014-12	Cambridge University Press
Boolean Functions: Theory, Algorithms, and Applications	Yves Crama; Peter L. Hammer	2011-05	Cambridge University Press
Boolean Functions: Theory, Algorithms, and Applications.	Yves Crama, Peter L. Hammer	2011	Cambridge University Press
Boolean functions: theory,algorithms,and applications	Yves Crama	2011	Cambridge University Press
Complexity Theory of Real Functions	Ker-I Ko	1991	Birkhäuser Boston
Boolean Functions and Their Applications in Cryptography	Chuan-Kun Wu; Dengguo Feng	1st ed. 2016	Springer Berlin Heidelberg
Boolean Functions for Cryptography and Coding Theory	Claude Carlet	2021-01	Cambridge University Press
Cryptographic Boolean Functions and Applications (Second Edition)	Thomas W. Cusick and Pantelimon Stănică	2017	Academic Press
Boolean functions in cryptology and information security	NATO Advanced Study Institute on Boolean Functions in Cryptology and Information Security (2007 Zvenigorod, Russia)	2008	IOS Press
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
The Complexity of Boolean Functions		Complexity Theory: Exploring the Limits of Efficient Algorithms	Ingo Wegener	2005	Springer Berlin Heidelberg
The VLSI complexity of Boolean functions	M. R. Kramer; J. van Leeuwen	Logic and Machines: Decision Problems and Complexity: Proceedings of the Symposium “Rekursive Kombinatorik” held from May 23–28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfalen	E. Börger; G. Hasenjaeger; D. Rödding	1984	Springer Berlin Heidelberg
The multiplicative complexity of boolean functions	C. P. Schnorr	Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 6th International Conference, AAECC-6, Rome, Italy, July 4-8, 1988. Proceedings	Teo Mora	1989	Springer Berlin Heidelberg
The complexity of symmetric boolean functions	Ingo Wegener	Computation Theory and Logic	Egon Börger	1987	Springer Berlin Heidelberg
On Cryptographic Complexity of Boolean Functions	Claude Carlet	Finite Fields with Applications to Coding Theory, Cryptography and Related Areas: Proceedings of the Sixth International Conference on Finite Fields and Applications, held at Oaxaca, México, May 21–25, 2001	Gary L. Mullen; Henning Stichtenoth; Horacio Tapia-Recillas	2002	Springer Berlin Heidelberg
432 Circuit Complexity of Boolean Functions		Foundations of Computing	J. Gruska	1997	Thomson Learning
The conjunctive complexity of quadratic boolean functions	Katja Lenz; Ingo Wegener	CSL ' 87: 1st Workshop on Computer Science Logic, Karlsruhe, FRG, October 12-16, 1987. Proceedings	Egon Börger; Hans Kleine Büning; Michael M. Richter	1988	Springer Berlin Heidelberg
On the complexity of balanced Boolean functions	A. Bernasconi	Algorithms and Complexity: Third Italian Conference, CIAC' 97, Rome, Italy, March 12-14, 1997, Proceedings	Giancarlo Bongiovanni; Daniel P. Bovet; Giuseppe Di Battista	1997	Springer Berlin Heidelberg
Circuit Complexity and Multiplicative Complexity of Boolean Functions	Arist Kojevnikov; Alexander S. Kulikov	Programs, Proofs, Processes: 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010, Proceedings	Fernando Ferreira; Benedikt Löwe; Elvira Mayordomo; Luís Mendes Gomes	2010	Springer Berlin Heidelberg
Coordination Complexity and the Rank of Boolean Functions	B. Gopinath; V. K. Wei	Open Problems in Communication and Computation	Thomas M. Cover; B. Gopinath	1987	Springer New York
On the Modulo Degree Complexity of Boolean Functions	Qian Li; Xiaoming Sun	Computing and Combinatorics: 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings	Yixin Cao; Jianer Chen	1st ed. 2017	Springer International Publishing
Sensitivity Versus Certificate Complexity of Boolean Functions	Andris Ambainis; Krišjānis Prūsis; Jevgēnijs Vihrovs	Computer Science – Theory and Applications: 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings	Alexander S. Kulikov; Gerhard J. Woeginger	1st ed. 2016	Springer International Publishing
Average-Case Complexity of Partial Boolean Functions	Alexander Chashkin	Stochastic Algorithms: Foundations and Applications: Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings	Andreas Albrecht; Kathleen Steinhöfel	2003	Springer Berlin Heidelberg
On the argument complexity of multiply transitive Boolean functions	U. Hedtstück	Logic and Machines: Decision Problems and Complexity: Proceedings of the Symposium “Rekursive Kombinatorik” held from May 23–28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfalen	E. Börger; G. Hasenjaeger; D. Rödding	1984	Springer Berlin Heidelberg
On the Monotone Circuit Complexity of Quadratic Boolean Functions	Kazuyuki Amano; Akira Maruoka	Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings	Rudolf Fleischer; Gerhard Trippen	2005	Springer Berlin Heidelberg
One-Way Communication Complexity of Symmetric Boolean Functions	Jan Arpe; Andreas Jakoby; Maciej Liśkiewicz	Fundamentals of Computation Theory: 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings	Andrzej Lingas; Bengt J. Nilsson	2003	Springer Berlin Heidelberg
New Bounds for Energy Complexity of Boolean Functions	Krishnamoorthy Dinesh; Samir Otiv; Jayalal Sarma	Computing and Combinatorics: 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings	Lusheng Wang; Daming Zhu	1st ed. 2018	Springer International Publishing
The Boolean Functions		Programming Android with Kotlin: Achieving Structured Concurrency with Coroutines	Pierre-Olivier Laurence, Amanda Hinchman-Dominguez, G. Blake Meike, Mike Dunn	2021	O'Reilly Media
The Boolean Functions		Programming Android with Kotlin: Achieving Structured Concurrency with Coroutines	P. Laurence, A. Hinchman-Dominguez, G. Meike, M. Dunn	2022	O'Reilly Media
Boolean circuit complexity	Mike Paterson	Algorithms and Computation: Third International Symposium, ISAAC ' 92, Nagoya, Japan, December 16-18, 1992. Proceedings	Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama; Takao Nishizeki; Masafumi Yamashita	1992	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries