scientific article; zbMATH DE number 4187721
From MaRDI portal
Publication:5752496
Recommendations
- On the complexity of realization of partial Boolean functions by circuits of functional elements
- scientific article; zbMATH DE number 15477
- scientific article; zbMATH DE number 850402
- On the complexity and depth of circuits that realize partial Boolean functions
- scientific article; zbMATH DE number 2095572
- scientific article; zbMATH DE number 850321
- scientific article; zbMATH DE number 6004901
- On the complexity of circuit realization of Boolean functions in an infinite basis
- scientific article; zbMATH DE number 4170848
- On the complexity of realization of Boolean functions by formulas
Cited in
(25)- On the complexity of realizing the powers of a Boolean (n,n)-function
- On estimates on the complexity of restrictions of Boolean functions
- Generalization of cardinality estimates for plane circuits realizing partial Boolean operators
- Complexity of activity tests for partial Boolean functions
- Inner-core and outer-core functions of partially defined Boolean functions
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis
- Complexity of sequential implementation of partial Boolean functions
- Using Flexibility in P-Circuits by Boolean Relations
- On the complexity of realization of Boolean functions by formulas
- scientific article; zbMATH DE number 6004901 (Why is no real title available?)
- On the complexity of restrictions of Boolean functions
- scientific article; zbMATH DE number 3864538 (Why is no real title available?)
- scientific article; zbMATH DE number 4170848 (Why is no real title available?)
- Complexity Based on Partitioning of Boolean Circuits and their Relation to Multivalued Circuits
- scientific article; zbMATH DE number 3959281 (Why is no real title available?)
- scientific article; zbMATH DE number 15477 (Why is no real title available?)
- To the problem of realizability of Boolean functions by circuits in a basis of unreliable functional elements
- Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
- On the complexity and depth of circuits that realize partial Boolean functions
- scientific article; zbMATH DE number 2123423 (Why is no real title available?)
- scientific article; zbMATH DE number 850402 (Why is no real title available?)
- Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates
- The complexity of Boolean function implementation in some classes of automaton circuits
- Average case complexity for finite Boolean functions
- Lower bounds for the complexity of restrictions of 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 Q5752496)
