Algorithms for synthesis of polynomials implementing weakly specified Boolean functions and systems

DOI10.1023/B:AURC.0000030908.29984.CAzbMATH Open1075.94033OpenAlexW2069534278MaRDI QIDQ2487688

A. D. Zakrevskij

Publication date: 8 August 2005

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:aurc.0000030908.29984.ca

zbMATH Keywords

multivalued logicmatrix logic equations

Mathematics Subject Classification ID

Related Items (2)

Algorithms of Boolean differential calculus for systolic processors ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials 👍 👎
• Polynomial transformation of Boolean functions: analysis of computational algorithms 👍 👎
• An algebraical system for polynomial representation of k-valued logical functions 👍 👎
• Computing Boolean functions by polynomials and threshold circuits 👍 👎
• Systolic synthesis algorithms for arithmetic polynomial forms of \(k\)-valued functions of Boolean algebra 👍 👎
• Boolean functional synthesis: hardness and practical algorithms 👍 👎
• A method for constructing polynomials of k-valued logic functions 👍 👎
• Polynomial algorithms for the synthesis of bounded nets 👍 👎

This page was built for publication: Algorithms for synthesis of polynomials implementing weakly specified Boolean functions and systems

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