Representations of normalized formulas

DOI10.33048/DAIO.2022.29.751MaRDI QIDQ5878634FDOQ5878634

Authors: K. L. Rychkov 

Publication date: 21 February 2023

Full work available at URL: http://mathnet.ru/eng/da1310

Recommendations

• On minimal \(\pi\)-schemes for linear Boolean functions
• Representation of logic formulas by normal forms.
• System of transformations of certain representations of Boolean functions
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions
• scientific article; zbMATH DE number 107561

zbMATH Keywords

Boolean functionminimal formulalower bound for complexity\( \Pi \)-partition\( \Pi \)-schemenormalized formularepresentation of formula

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Cites Work

• Monotone Circuits for Connectivity Require Super-Logarithmic Depth
• Applications of matrix methods to the theory of lower bounds in computational complexity
• Method of determining lower bounds for the complexity of \(\Pi\)-circuits
• Title not available (Why is that?)
• The Shrinkage Exponent of de Morgan Formulas is 2
• Complexity of the realization of a linear function in the class of \(\Pi\)-circuits
• Lower bounds on the formula complexity of a linear Boolean function
• Title not available (Why is that?)
• Formula complexity of a linear function in a \(k\)-ary basis
• Computation complexity of a ternary linear function
• Complexity of the realization of a linear Boolean function in the class of \(\pi\)-schemes
• Sufficient conditions for the local repetition-freeness of minimal \(\pi\)-schemes realizing linear Boolean functions
• Title not available (Why is that?)
• A simplified proof of a lower complexity estimate

Cited In (1)

• On the structure of one class of perfect \(\Pi \)-partitions

This page was built for publication: Representations of normalized formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5878634)