Logical semirings and their usage for construction of quick algorithms

zbMATH Open0914.94026MaRDI QIDQ1280316

V. B. Alekseev

Publication date: 15 March 1999

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

logical semiringpartial Boolean functions

Mathematics Subject Classification ID

Related Items (1)

Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates

Recommendations

• A method of constructing fast algorithms in the k-valued logic 👍 👎
• Semirings for constraint solving and programming. 👍 👎
• On semilattice-based logics with an algebraizable assertional companion 👍 👎
• Semiring-Induced Propositional Logic: Definition and Basic Algorithms 👍 👎
• Semialgebraic Proofs and Efficient Algorithm Design 👍 👎
• Fast algorithms for deciding the equivalence of propositional operator programs on ordered semigroup scales 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Logical semirings and their usage for construction of quick algorithms

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