Aufsatzsammlung
From Boolean logic to switching circuits and automata : towards modern information technology
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783642116810
- Maße
-
24 cm
- Umfang
-
XVII, 212 S.
- Sprache
-
Englisch
- Anmerkungen
-
Ill.
Literaturangaben
- Erschienen in
-
Studies in computational intelligence ; Vol. 335
- Klassifikation
-
Elektrotechnik, Elektronik
- Schlagwort
-
Geschichte
Schaltungstheorie
Boolesche Algebra
Schaltungstheorie
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin, Heidelberg
- (wer)
-
Springer
- (wann)
-
2011
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
- 11.06.2025, 14:21 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Aufsatzsammlung
Beteiligte
- Stanković, Radomir S.
- Astola, Jaakko
- Springer
Entstanden
- 2011
Ähnliche Objekte (12)
Embedding Arbitrary Boolean Circuits into Fungal Automata
Languages, automata, and logic
Logic synthesis with Boolean model
Boolean techniques in testing of digital circuits
Logic programming with pseudo-Boolean constraints
Boolean Connexive Logic and Content Relationship
Derandomizing RP if Boolean circuits are not learnable
Memristive Stateful Logic for Edge Boolean Computers
Novel ultra-energy-efficient reversible designs of sequential logic quantum-dot cellular automata flip-flop circuits
Asymmetric magnetization switching and programmable complete Boolean logic enabled by long-range intralayer Dzyaloshinskii-Moriya interaction
Universal logic-in-memory cell enabling all basic Boolean algebra logic
Implementing Boolean Logic in Ferroelectric Field‐Effect Transistors
Embedding Arbitrary Boolean Circuits into Fungal Automata
Languages, automata, and logic
Logic synthesis with Boolean model
Boolean techniques in testing of digital circuits
Logic programming with pseudo-Boolean constraints
Boolean Connexive Logic and Content Relationship
Derandomizing RP if Boolean circuits are not learnable
Memristive Stateful Logic for Edge Boolean Computers
Novel ultra-energy-efficient reversible designs of sequential logic quantum-dot cellular automata flip-flop circuits
Asymmetric magnetization switching and programmable complete Boolean logic enabled by long-range intralayer Dzyaloshinskii-Moriya interaction
Universal logic-in-memory cell enabling all basic Boolean algebra logic
Implementing Boolean Logic in Ferroelectric Field‐Effect Transistors
Embedding Arbitrary Boolean Circuits into Fungal Automata
Languages, automata, and logic
Logic synthesis with Boolean model
Boolean techniques in testing of digital circuits
Logic programming with pseudo-Boolean constraints
Boolean Connexive Logic and Content Relationship
Derandomizing RP if Boolean circuits are not learnable
Memristive Stateful Logic for Edge Boolean Computers
Novel ultra-energy-efficient reversible designs of sequential logic quantum-dot cellular automata flip-flop circuits
Asymmetric magnetization switching and programmable complete Boolean logic enabled by long-range intralayer Dzyaloshinskii-Moriya interaction
Universal logic-in-memory cell enabling all basic Boolean algebra logic