On Simplifying Expressions with Mixed Boolean-Arithmetic

DOI10.18255/1818-1015-2023-2-140-159MaRDI QIDQ6057724zbMATH OpenOpenAlexFDO

Authors Yury V. Kosolapov

Publication date 5 October 2023

Published in Modeling and Analysis of Information Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

code obfuscationdecoding by information setsMBA-expressionssimplification of MBA-expressions

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• Admissible Galois structures on the categories dual to some varieties of universal algebras
• Information-set decoding for linear codes over F_q
• On the inherent intractability of certain coding problems (Corresp.)

This page was built for publication: On Simplifying Expressions with Mixed Boolean-Arithmetic

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