scientific article; zbMATH DE number 4051572

zbMATH Open0645.03017MaRDI QIDQ3787980FDOQ3787980

Authors: V. B. Alekseev 

Publication date: 1987

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

approximate algorithmsrecognition algorithmslinear formsk-valued logic

Mathematics Subject Classification ID

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

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)