Complexity of the satisfiability problem for multilinear forms over a finite field

DOI10.3103/S0278641917020066zbMath1385.65037OpenAlexW2620918030MaRDI QIDQ682219

Svetlana N. Selezneva

Publication date: 14 February 2018

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641917020066

zbMATH Keywords

polynomial algorithmsatisfiabilitylinear functionmultilinear form\(NP\)-complete problemfunction over finite field

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of the conservative generalized satisfiability problem
• A dichotomy theorem for constraint satisfaction problems on a 3-element set
• The complexity of satisfiability problems
• The complexity of theorem-proving procedures

This page was built for publication: Complexity of the satisfiability problem for multilinear forms over a finite field