CNF Satisfiability in a Subspace and Related Problems

We introduce the problem of finding a satisfying assignment to a CNF formula that must further belong to a prescribed input subspace. Equivalent formulations of the problem include finding a point outside a union of subspaces (the Union-of-Subspace Avoidance (USA) problem), and finding a common zero...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 84; číslo 11; s. 3276 - 3299
Hlavní autori:	Arvind, V., Guruswami, Venkatesan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2022 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Degree reduction Formulations Mathematical analysis Mathematics of Computing Optimization Polynomials Run time (computers) Special Issue on Parameterized and Exact Computation (IPEC 2021) Subspaces Theory of Computation CNF formulas Satisfiability problem Fast exponential algorithms Linear equations
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!