Computations in Boolean Algebra with Approximation

DOI10.3233/FI-2014-1120zbMATH Open1329.68304OpenAlexW1647634196MaRDI QIDQ5259290FDOQ5259290

Armen Kostanyan, Paruyr Khnkoyan

Publication date: 26 June 2015

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2014-1120

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Many-valued logic (03B50) Boolean functions (06E30) Logical aspects of Boolean algebras (03G05) Generalizations of Boolean algebras (06E75)

Cited In (5)

• Approximating Boolean functions by OBDDs
• Title not available (Why is that?)
• Algebraically degenerate approximations of Boolean functions
• Mathematical Foundations of Computer Science 2004
• Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large \(n\)

This page was built for publication: Computations in Boolean Algebra with Approximation

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