Boolean function complexity :

kod QR

Boolean function complexity : Advances and frontiers

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. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that ha...

Szczegółowa specyfikacja

Zapisane w:

Opis bibliograficzny
1. autor:	Jukna, Stasys
Format:	Książka
Język:	Undetermined
Wydane:	Berlin Springer 2012
Hasła przedmiotowe:	Computer science,Khoa học máy tính Mathematics,Toán học
Etykiety:	Dodaj etykietę Nie ma etykietki, Dołącz pierwszą etykiete!

Thư viện lưu trữ:	Trung tâm Học liệu Trường Đại học Cần Thơ

Podobne zapisy

The complexity of Boolean functions
od: Wegener, Ingor
Wydane: (2010)

Dynamics of Complex Autonomous Boolean Networks
od: Rosin, David P
Wydane: (2015)

Boolean Representations of Simplicial Complexes and Matroids
od: Rhodes, John, i wsp.
Wydane: (2015)

Optimization techniques for solving complex problems
Wydane: (2009)

Boolean Functions in Cryptology and Information Security
od: Preneel, Bart, i wsp.
Wydane: (2013)

Mathematics for programming computers
od: Clark, Frank
Wydane: (1988)

Computing Boolean statistical models /
od: Oliveira, P. M. C. de
Wydane: (1991)

The definitive guide to how computers do math :
od: Maxfield, Clive
Wydane: (2005)

Mathématiques pour l'informatique :
od: Arnold, André
Wydane: (1997)

The definitive guide to how computers do math :
od: Maxfield, Clive
Wydane: (2005)

Modeling and simulation of logistics flows 3
od: Réveillac, Jean-Michel
Wydane: (2017)

Modeling and simulation of logistics flows 2
od: Réveillac, Jean-Miche
Wydane: (2017)

Modeling and simulation of logistics flows 1
od: Réveillac, Jean-Michel
Wydane: (2017)

Extremal combinatorics : with applications in computer science /
od: Jukna, Stasys, 1953-
Wydane: (2001)

Extremal combinatorics : with applications in computer science /
od: Jukna, Stasys, 1953-
Wydane: (2001)

Advances in Agent-Based Complex Automated Negotiations
Wydane: (2020)

Descriptional Complexity of Formal Systems
od: Konstantinidis, Stavros, i wsp.
Wydane: (2020)

Multi-layer channel routing complexity and algorithms
od: Pal, Rajat K.
Wydane: (2000)

Aggregation Functions: A Guide for Practitioners
od: Beliakov, Gleb, i wsp.
Wydane: (2020)

Introduction to computational science and mathematics
od: Loan, Charles F. Van
Wydane: (1996)

Bebop to the Boolean Boogie
od: Maxfield, Clive
Wydane: (2011)

Computation and Complexity in Economic Behavior and Organization
od: Mount, Kenneth R
Wydane: (2002)

Cellular Automata and Discrete Complex Systems
od: Kari, Jarkko
Wydane: (2015)

Computer mathematics :
Wydane: (2003)

Membrane Protein Complexes: Structure and Function
od: Harris, J. Robin, i wsp.
Wydane: (2020)

Mathematics for electrical engineering and computing
od: Attenborough, Mary
Wydane: (2003)

Cellular Automata and Discrete Complex Systems
od: Baetens, Jan M., i wsp.
Wydane: (2020)

Discrete mathematics
od: Johnsonbaug, Richard
Wydane: (2019)

Complexity and Approximation
od: Du, Ding-Zhu, i wsp.
Wydane: (2020)

Sets, functions and numbers
od: Luthar, I. S.
Wydane: (2005)

Macromolecular Protein Complexes II: Structure and Function
od: Harris, J. Robin, i wsp.
Wydane: (2020)

Software complexity :
od: Zuse, Horst
Wydane: (1991)

Algorithms and Complexity. 1st ed. 2017
od: Fotakis, Dimitris, i wsp.
Wydane: (2020)

Computational semantics with functional programming
od: Eijck, J. van
Wydane: (2010)

Logic and Boolean Algebra /
od: Arnold, B. H.
Wydane: (1962)

Advanced Boolean Techniques
od: Drechsler, Rolf, i wsp.
Wydane: (2020)

Complex Effects in Large Eddy Simulations
od: Kassinos, Stavros, i wsp.
Wydane: (2020)

Mining Complex Data
od: Zighed, Djamel A., i wsp.
Wydane: (2020)

Discrete mathematical structures for computer scientists and engineers
od: Das, M. K.
Wydane: (2007)

Computing Boolean statistical models
od: Oliveira, Paulo Murilo Castro de