Titlebook: Mathematical Foundations of Computer Science 2007; 32nd International S Luděk Kučera,Antonín Kučera Conference proceedings 2007 Springer-Ve

Genteel

sclera

可卡

critic

Linear Circuits, Two-Variable Logic and Weakly Blocked Monoidse property, a one-to-one correspondence between .-uniform linear circuits, two-variable formulae with . predicates, and weak block products of monoids. In particular, we consider the case of linear TC., majority quantifiers, and finitely typed monoids. This correspondence will hold for any numerical

掺和

Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Completeblem ., where . is any subprojective relational structure. As a consequence we get a new proof (not using universal algebra) that . is .-complete for any subprojective (and thus also projective) relational structure. This provides a starting point for a new combinatorial approach to the NP-completen

透明

NP by Means of Lifts and Shadowsese classes are defined by means of shadows (projections) and by finitely many forbidden colored (lifted) subgraphs. Our characterization is motivated by the analysis of syntactical subclasses with the full computational power of NP, which were first studied by Feder and Vardi..Our approach applies

BLOT

性冷淡

说明

LUMEN