Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Vikraman Arvind, Venkatesan Guruswami. CNF Satisfiability in a Subspace and Related Problems. Electronic Colloquium on Computational Complexity (ECCC), 28:112, 2021. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: CNF Satisfiability in a Subspace and Related ProblemsVikraman Arvind, Venkatesan Guruswami. iwpec 2021: [doi] CNF Satisfiability in a Subspace and Related ProblemsVikraman Arvind, Venkatesan Guruswami. algorithmica, 84(11):3276-3299, 2022. [doi] On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF FormulasVikraman Arvind, Somenath Biswas. TCS, 68(2):123-134, 1989.
The following publications are possibly variants of this publication: