scientific article; zbMATH DE number 4051572

MaRDI QIDQ3787980zbMATH OpenFDO

Authors V. B. Alekseev

Publication date 1987

zbMATH Keywords

approximate algorithmsk-valued logiclinear formsrecognition algorithms

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04) Many-valued logic (03B50) Complexity of computation (including implicit computational complexity) (03D15) Quadratic forms over general fields (11E04) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A method of constructing fast algorithms in the k-valued logic
• scientific article; zbMATH DE number 4212010
• On application of generalised polynomials to constructing algorithms to recognise properties of \(k\)-valued functions defined by polynomials
• The complexity of recognizing the preservation of some sets by multivalued functions represented by polynomials
• scientific article; zbMATH DE number 4002067

Cited in

(1)

• A method of constructing fast algorithms in the k-valued logic

This page was built for publication:

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