On the complexity of the sequential sampling method

DOI10.33048/DAIO.2024.31.766MaRDI QIDQ6648361zbMATH OpenFDO

Authors V. M. Fomichev

Publication date 4 December 2024

Published in Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/DAIO.2024.31.766

zbMATH Keywords

Boolean functionchain in latticeessential variablesubset lattice of set

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
• On systems of Boolean equations
• Sequential importance sampling of binary sequences
• scientific article; zbMATH DE number 4014450
• scientific article; zbMATH DE number 3874954

Cites work

• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 47903 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 481378 (Why is no real title available?)
• scientific article; zbMATH DE number 1950612 (Why is no real title available?)
• scientific article; zbMATH DE number 774344 (Why is no real title available?)
• scientific article; zbMATH DE number 3373269 (Why is no real title available?)
• On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables

This page was built for publication: On the complexity of the sequential sampling method

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