Machine resolving of discrete mathematics problems

DOI10.18454/2079-6641-2011-3-2-58-68MaRDI QIDQ4961968zbMATH OpenFDO

Authors A. P. Goryushkin

Publication date 29 October 2018

Full work available at URL http://mathnet.ru/eng/vkam91

zbMATH Keywords

graphBoolean functionmaximum flowZhegalkin polynomialself-dual functionsfunctionally complete set

Mathematics Subject Classification ID

Flows in graphs (05C21) Signed and weighted graphs (05C22) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Recommendations

• scientific article; zbMATH DE number 917342
• Discrete mathematics
• Algebraic models for discrete systems' analysis
• scientific article; zbMATH DE number 3724347
• Collection of problems for discrete mathematics

Cited in

(3)

• scientific article; zbMATH DE number 6967854 (Why is no real title available?)
• ON THE METHODOLOGY APPLICATION OF MODERN COMPUTING TECHNOLOGIES IN STUDYING THE THEORY OF NUMBERS
• Computer experiment in teaching mathematical disciplines

This page was built for publication: Machine resolving of discrete mathematics problems

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