The complexity of recognizing the preservation of some sets by multivalued functions represented by polynomials

DOI10.3103/S0278641911030034zbMath1232.03012OpenAlexW2046439625MaRDI QIDQ763511

Anton V. Bukhman

Publication date: 12 March 2012

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641911030034

zbMATH Keywords

polynomial algorithmmultivalued logic functionpolynomial modulo \(k\)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Many-valued logic (03B50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of recognizing the preservation of some sets by multivalued functions represented by polynomials