scientific article; zbMATH DE number 919269
From MaRDI portal
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)- scientific article; zbMATH DE number 4137716 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 609985 (Why is no real title available?)
- Circuit complexity of symmetric Boolean functions in antichain basis
- scientific article; zbMATH DE number 4211970 (Why is no real title available?)
- Implementation complexity of Boolean functions with a small number of ones
- scientific article; zbMATH DE number 3599961 (Why is no real title available?)
- scientific article; zbMATH DE number 3968581 (Why is no real title available?)
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)
