Sciweavers

173 search results - page 9 / 35
» Asymptotic classes of finite structures
Sort
View
ITA
2008
111views Communications» more  ITA 2008»
13 years 7 months ago
A new algebraic invariant for weak equivalence of sofic subshifts
It is studied how taking the inverse image by a sliding block code affects the syntactic semigroup of a sofic subshift. Two independent approaches are used: -semigroups as recogni...
Laura Chaubard, Alfredo Costa
CSL
2009
Springer
13 years 11 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
TIT
2008
140views more  TIT 2008»
13 years 7 months ago
A Resource Framework for Quantum Shannon Theory
Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distilla...
Igor Devetak, Aram Wettroth Harrow, Andreas J. Win...
COMBINATORICA
2006
125views more  COMBINATORICA 2006»
13 years 7 months ago
Coloring Subgraphs of the Rado Graph
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
Norbert W. Sauer
EJC
2008
13 years 7 months ago
Pattern classes of permutations via bijections between linearly ordered sets
Abstract. A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which...
Sophie Huczynska, Nikola Ruskuc