scientific article; zbMATH DE number 919269
From MaRDI portal
zbMATH Open0856.94035MaRDI QIDQ4888933FDOQ4888933
Authors: M. I. Grinchuk 
Publication date: 25 February 1997
Title of this publication is not available (Why is that?)
Recommendations
- On complexity of realisation of a class of almost symmetric functions by formulas of depth 3
- scientific article; zbMATH DE number 4211970
- New upper bounds on the Boolean circuit complexity of symmetric functions
- On the complexity of monotone circuits for threshold symmetric Boolean functions
- scientific article; zbMATH DE number 3968581
Cited In (10)
- Title not available (Why is that?)
- On the complexity of realization of Boolean functions by formulas
- On complexity of realisation of a class of almost symmetric functions by formulas of depth 3
- There are no p-complete families of symmetric Boolean functions
- Title not available (Why is that?)
- Circuit complexity of symmetric Boolean functions in antichain basis
- Title not available (Why is that?)
- Implementation complexity of Boolean functions with a small number of ones
- Title not available (Why is that?)
- Title not available (Why is that?)
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 Q4888933)
