- Sprache
-
Englisch
- Umfang
-
XI, 435 S.
- ISBN
-
1-85233-266-2
- Identifier
-
961464224
- Reihe
-
Discrete mathematics and theoretical computer science
Thema
Boolesche Funktion ; Boolesche Gleichung
Beteiligte Personen und Organisationen
Rudeanu, Sergiu
- Inhaltsverzeichnis
- Rechteinformation
-
Der Zugriff auf Teile des Objekts ist unbeschränkt möglich.
- Letzte Aktualisierung
-
16.08.2023, 18:34 MESZ
Objekttyp
- Monografie
Beteiligte
- Rudeanu, Sergiu
Ähnliche Objekte (12)
Finite versus infinite : contributions to an eternal dilemma
Boolean functions and computation models
Introduction to circuit complexity : a uniform approach
Boolesche Gleichungen : [Theorie, Anwendungen, Algorithmen]
Boolean functions : with engineering applications and computer programs
Exploring randomness
Information algebras : generic structures for inference
Cardinal functions on Boolean algebras
Logic and complexity
Turing's connectionism : an investigation of neural network architectures
The complexity of Boolean functions
Sequences and their applications : proceedings of SETA '98
Finite versus infinite : contributions to an eternal dilemma
Boolean functions and computation models
Introduction to circuit complexity : a uniform approach
Boolesche Gleichungen : [Theorie, Anwendungen, Algorithmen]
Boolean functions : with engineering applications and computer programs
Exploring randomness
Information algebras : generic structures for inference
Cardinal functions on Boolean algebras
Logic and complexity
Turing's connectionism : an investigation of neural network architectures
The complexity of Boolean functions
Sequences and their applications : proceedings of SETA '98
Finite versus infinite : contributions to an eternal dilemma
Boolean functions and computation models
Introduction to circuit complexity : a uniform approach
Boolesche Gleichungen : [Theorie, Anwendungen, Algorithmen]
Boolean functions : with engineering applications and computer programs
Exploring randomness
Information algebras : generic structures for inference
Cardinal functions on Boolean algebras
Logic and complexity
Turing's connectionism : an investigation of neural network architectures
The complexity of Boolean functions