Reflexive digraphs with near unanimity polymorphisms (Q442320): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: László Zádori / rank
Normal rank
 
Property / author
 
Property / author: László Zádori / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.03.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073159267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruence Distributivity Implies Bounded Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finer reduction of constraint problems to digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of finite algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and Learnability Arising from Algebras with Few Subpowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maltsev digraphs have a majority polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order varieties and monotone retractions of finite posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jónsson terms and near-unanimity functions in finite posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for near-unanimity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic properties and dismantlability of finite posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Few subpowers, congruence distributivity and near-unanimity terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone clones, residual smallness and congruence distributivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed point theorem for finite partially orderes sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Jónsson operations and near unanimity functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational Sets and Categorical Equivalence of Algebras / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 5 July 2024

scientific article
Language Label Description Also known as
English
Reflexive digraphs with near unanimity polymorphisms
scientific article

    Statements

    Reflexive digraphs with near unanimity polymorphisms (English)
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    0 references
    reflexive digraphs
    0 references
    near unanimity
    0 references
    Jonsson
    0 references
    gumm and totally symmetric idempotent polymorphisms
    0 references
    constraint satisfaction
    0 references
    (1
    0 references
    2)-consistency checking algorithm
    0 references
    0 references