The rectangle complexity of functions on two-dimensional lattices
From MaRDI portal
Publication:5958335
DOI10.1016/S0304-3975(01)00281-XzbMath0989.68062MaRDI QIDQ5958335
Robert Tijdeman, Jürgen Sander
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture, MULTIDIMENSIONAL STURMIAN SEQUENCES AND GENERALIZED SUBSTITUTIONS, Double sequences of low complexity, Strong cocycle triviality for \(Z^{2}\) subshifts, Periodicity and local complexity, Complexity of short rectangles and periodicity, The complexity of functions on lattices, On a conjecture on bidimensional words., An algebraic geometric approach to Nivat's conjecture, Maximal pattern complexity of two-dimensional words, The automorphism group of a shift of subquadratic growth, An Algebraic Geometric Approach to Multidimensional Words
Cites Work