Back to Search Start Over

Multiple constraints on three and four words

Authors :
Czeizler, Elena
Source :
Theoretical Computer Science. Feb2008, Vol. 391 Issue 1/2, p14-19. 6p.
Publication Year :
2008

Abstract

Abstract: In this paper we consider several questions related to the defect theorem for sets of three and four words. We start by investigating how large systems of pairwise independent or pairwise non-equivalent equations over three unknowns possessing purely non-periodic solutions can be. In other words, we analyze how weak the cumulative defect effect of such systems is. Then, we investigate the maximal size of chains of equations over three or four words such that every time we add a new equation the set of solutions strictly decreases. [Copyright &y& Elsevier]

Details

Language :
English
ISSN :
03043975
Volume :
391
Issue :
1/2
Database :
Academic Search Index
Journal :
Theoretical Computer Science
Publication Type :
Academic Journal
Accession number :
28404444
Full Text :
https://doi.org/10.1016/j.tcs.2007.10.026