Testing the satisfiability of algebraic formulas over the field of two elements
From MaRDI portal
Publication:6137613
DOI10.1134/S0032946023010052MaRDI QIDQ6137613FDOQ6137613
Publication date: 4 September 2023
Published in: Problems of Information Transmission (Search for Journal in Brave)
Cites Work
- NP is as easy as detecting unique solutions
- Arithmetic circuits: a chasm at depth 3
- Is Valiant-Vazirani's isolation probability improvable?
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Computing Solutions Uniquely Collapses the Polynomial Hierarchy
- CNF satisfiability in a subspace and related problems
- The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent
- Progress on Polynomial Identity Testing - II
- Progress on Polynomial Identity Testing-II
- On the zeros of Boolean polynomials
This page was built for publication: Testing the satisfiability of algebraic formulas over the field of two elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137613)
