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

DOI10.3103/S0278641911030034zbMATH Open1232.03012OpenAlexW2046439625MaRDI QIDQ763511FDOQ763511

Authors: 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

Recommendations

• A method for constructing polynomials of k-valued logic functions
• On application of generalised polynomials to constructing algorithms to recognise properties of \(k\)-valued functions defined by polynomials
• A polynomial algorithm for the recognition of belonging a function of k-valued logic realized by a polynomial to precomplete classes of self-dual functions
• scientific article; zbMATH DE number 1873297
• On the number of functions of \(k\)-valued logic which are polynomials modulo composite \(k\)

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• On application of generalised polynomials to constructing algorithms to recognise properties of \(k\)-valued functions defined by polynomials
• Title not available (Why is that?)
• A polynomial algorithm for the recognition of belonging a function of k-valued logic realized by a polynomial to precomplete classes of self-dual functions

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

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