Testing the satisfiability of algebraic formulas over the field of two elements

DOI10.1134/s0032946023010052MaRDI QIDQ6137613

Mikhail N. Vyalyi

Publication date: 4 September 2023

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

probabilistic algorithmalgebraic formulassatisfiability of Boolean formulas

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Is Valiant-Vazirani's isolation probability improvable?
• NP is as easy as detecting unique solutions
• On the zeros of Boolean polynomials
• CNF satisfiability in a subspace and related problems
• Arithmetic Circuits: A Chasm at Depth 3
• Progress on Polynomial Identity Testing-II
• Progress on Polynomial Identity Testing - II
• Computing Solutions Uniquely Collapses the Polynomial Hierarchy
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Testing the satisfiability of algebraic formulas over the field of two elements