On the alphabetical satisfiability problem for trace equations

Abstract

In this paper we summarize some results of a work in progress on the computational complexity of the alphabetical satisfiability problem for linear trace equations. In particular we prove that the problem is in P under some conditions on the maximal I-cliques. 

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.