Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Parity Function
CHF 43.10
Auf Lager
SKU
LKRQRCSU10V
1 Verfügbar 
Geliefert zwischen Fr., 23.01.2026 und Mo., 26.01.2026
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In Boolean algebra, a parity function is a Boolean function whose value is 1 if the input vector has odd number of ones. The parity function is notable for its role in theoretical investigation of circuit complexity of Boolean functions. In early 1980s Merrick Furst, James Saxe and Michael Sipser and independently Miklós Ajtai established super-polynomial lower bounds on the size of constant-depth Boolean circuits for the parity function,i.e., they have shown that polynomial-size constant-depth circuits cannot compute the parity function. Similar results were also established for the majority, multiplication and transitive closure functions, by reduction to the parity function problem. Until this time only linear lower bounds were known for various naturally arising functions.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131263101
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131263101
- Format Fachbuch
- Titel Parity Function
- Herausgeber Betascript Publishing
- Anzahl Seiten 96
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
