The method of artificial constraints for estimating the number of discrete functions.

zbMATH Open1201.06008MaRDI QIDQ5445409FDOQ5445409

Authors: V. B. Alekseev 

Publication date: 5 March 2008

Recommendations

• The mimber of functions in some closed classes of partial k-valued logic
• On a certain approach to the problem of estimating the number of discrete functions
• The growth of number of discrete Lipschitzian functions under growing dimensions of the domain of their definition
• scientific article; zbMATH DE number 7525
• On the outcome of false images of linear \(k\)-valued functions for composite numbers \(k\) when the number of variables increases

Mathematics Subject Classification ID

Many-valued logic (03B50) Boolean functions (06E30)

Cited In (2)

• On a certain approach to the problem of estimating the number of discrete functions
• The growth of number of discrete Lipschitzian functions under growing dimensions of the domain of their definition

This page was built for publication: The method of artificial constraints for estimating the number of discrete functions.

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