On complexity of standard forms for multifunctions

zbMATH Open1451.68133MaRDI QIDQ1789736FDOQ1789736

Authors: Alekseĭ Sergeevich Kazimirov 

Publication date: 10 October 2018

Published in: The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

Full work available at URL: http://mathizv.isu.ru/journal/downloadArticle?article=_f895ee88174f4156858f90eb3ba51f92&lang=rus

Recommendations

• A completeness criterion for sets of multifunctions in full partial ultraclone of rank 2
• Complexity of realization by formulas of special form for functions of multivalued logic
• On read-once multifunctions in some base
• Binary functions of multivalued arguments: generalization and investigation of disjunctive normal forms for such functions
• On maximal clones of partial ultrafunctions on a two-element set

zbMATH Keywords

minimizationcomplexitymultifunctiondisjunctive normal form

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Other classical set theory (including functions, relations, and set algebra) (03E20)

Cites Work

• Clones, co-clones, hyperclones and superclones
• Galois theory for clones and superclones
• A completeness criterion for underdetermined partial Boolean functions
• The completeness problem in partial hyperclones
• Title not available (Why is that?)
• Standard forms of multioperations in superclones

This page was built for publication: On complexity of standard forms for multifunctions

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