scientific article; zbMATH DE number 2032375

zbMATH Open1033.94570MaRDI QIDQ4446221

Author name not available (Why is that?)

Publication date: 26 January 2004

Title of this publication is not available (Why is that?)

zbMATH Keywords

complexityBoolean functionsautomaton circuitsShannon functionsymmetric basiscomplete basisautomaton formula

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30)

Related Items (1)

The complexity of Boolean function implementation in some classes of automaton circuits

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 Q4446221)