scientific article; zbMATH DE number 4204280
From MaRDI portal
Publication:3352964
zbMATH Open0728.94009MaRDI QIDQ3352964FDOQ3352964
Authors: Gy. Turán 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
- On circuit functionality in Boolean networks
- scientific article; zbMATH DE number 1256716
- Lower bounds for unrestricted Boolean circuits: open problems
- On the complexity of restrictions of Boolean functions
- On the complexity and depth of circuits that realize partial Boolean functions
- scientific article; zbMATH DE number 169103
- Minimally unsatisfiable Boolean circuits
- Circuit complexity and multiplicative complexity of Boolean functions
- Boolean circuits versus arithmetic circuits
- scientific article; zbMATH DE number 4045650
Cited In (9)
- Lower bounds for synchronous circuits and planar circuits
- Title not available (Why is that?)
- Extensional Uniformity for Boolean Circuits
- Separating OR, SUM, and XOR circuits
- Communication Complexity and Lower Bounds on Multilective Computations
- Sparse Boolean equations and circuit lattices
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
- The size and depth of layered Boolean circuits
- Using Flexibility in P-Circuits by Boolean Relations
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 Q3352964)
