On properties of multiaffine predicates on a finite set

DOI10.1515/dma-2023-0023OpenAlexW4385989339MaRDI QIDQ6051969

Svetlana N. Selezneva

Publication date: 20 September 2023

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2023-0023

zbMATH Keywords

complexityalgorithmpolynomial algorithmdisjunctive normal formmultiaffinityaffine operationfunction on finite setpredicate on finite set

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computational number theory (11Yxx) Finite fields and commutative rings (number-theoretic aspects) (11Txx)

Cites Work

• Unnamed Item
• Unnamed Item
• On weak positive predicates over a finite set
• On bijunctive predicates over a finite set
• The complexity of solving equations over finite groups
• Multiaffine polynomials over a finite field
• Closure properties of constraints
• On m-Junctive Predicates on a Finite Set
• The complexity of satisfiability problems

This page was built for publication: On properties of multiaffine predicates on a finite set