The Complexity of Promise SAT on Non-Boolean Domains

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Alex Brandts, Marcin Wrochna, Stanislav Zivny

Journal title: ACM Transactions on Computation Theory

Journal publisher: Association for Computing Machinary, Inc.

Published year: 2021

DOI identifier: 10.1145/3470867

ISSN: 1942-3454