scientific article; zbMATH DE number 176868
From MaRDI portal
Publication:4036699
zbMATH Open0764.06005MaRDI QIDQ4036699FDOQ4036699
Authors: W. M. Beynon 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
- Boolean function complexity. Advances and frontiers.
- On the multiplicative complexity of Boolean functions
- On the complexity of restrictions of Boolean functions
- scientific article; zbMATH DE number 4012495
- scientific article; zbMATH DE number 4108153
- The generalized complexity of linear Boolean functions
- scientific article; zbMATH DE number 1294417
- On complexity of a particular Boolean functions class
- On the multiplicative complexity of some Boolean functions
- The complexity of Boolean functions in different characteristics
partitionpathsdistributive latticescircuitsimplicantsmonotone Boolean functionfree distributive latticecomputational equivalencereplaceabilityCayley diagramprime clauses
Analysis of algorithms and problem complexity (68Q25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Boolean functions (06E30) Structure and representation theory of distributive lattices (06D05)
Cited In (14)
- On the parity complexity measures of Boolean functions
- The \(\ell_p\)-function on finite Boolean lattices
- Book review of: S. Jukna, Boolean function complexity. Advances and frontiers.
- Using the renormalization group to classify Boolean functions
- Sparse Boolean equations and circuit lattices
- Critical properties and complexity measures of read-once Boolean functions
- On the positive and the inversion complexity of Boolean functions
- Boolean complexity classes vs. their arithmetic analogs
- A note on lattice variant of thresholdness of Boolean functions
- Laced Boolean functions and subset sum problems in finite fields
- The complexity of Boolean functions in different characteristics
- Behavior of Shannon functions for complexity of parametric representations of Boolean functions
- Local complexity of Boolean functions
- On the computational complexity of some classical equivalence relations on boolean functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036699)
