scientific article; zbMATH DE number 4028940

MaRDI QIDQ3769993zbMATH OpenFDO

Authors E. V. Dyukova

Publication date 1987

zbMATH Keywords

almost maximal conjunctionsBoolean functionprime implicants

Mathematics Subject Classification ID

Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Recommendations

• scientific article; zbMATH DE number 2208745
• Recognition complexity for Schaefer classes
• Algorithmic Learning Theory
• Recognition complexity of theories and their computational expressivity
• On the recognition complexity of some graph properties
• On recognition and compactification
• Recognition problems and communication complexity.
• The recognition complexity of decidable theories
• On Several Proofs of the Recognizability Theorem

Cited in

(7)

• Recognition problems and communication complexity.
• On the logical analysis of partially ordered data in the supervised classification problem
• Finding maximal independent elements of products of partial orders (the case of chains)
• Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions
• On a non-classical recognition problem
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
• scientific article; zbMATH DE number 2208745 (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 Q3769993)