scientific article; zbMATH DE number 7310227

zbMath1478.68100MaRDI QIDQ5150602

Valentina Vladimirovna Bykova

Publication date: 15 February 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

splitting algorithmscomputational complexity of recursive algorithmssolving recurrence relations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Numerical aspects of recurrence relations (65Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New worst-case upper bounds for SAT
• A perspective on certain polynomial-time solvable classes of satisfiability
• New methods for 3-SAT decision and worst-case analysis
• Algorithms for Sat and upper bounds on their complexity
• New upper bounds for the problem of maximal satisfiability
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving

This page was built for publication: