Switch to: References

Add citations

You must login to add citations.
  1. Computational complexity of linear constraints over the integers.Peter Jonsson & Tomas Lööw - 2013 - Artificial Intelligence 195 (C):44-62.
    Download  
     
    Export citation  
     
    Bookmark  
  • Reducts of the Random Bipartite Graph.Yun Lu - 2013 - Notre Dame Journal of Formal Logic 54 (1):33-46.
    Let $\Gamma$ be the random bipartite graph, a countable graph with two infinite sides, edges randomly distributed between the sides, but no edges within a side. In this paper, we investigate the reducts of $\Gamma$ that preserve sides. We classify the closed permutation subgroups containing the group $\operatorname {Aut}(\Gamma)^{\ast}$ , where $\operatorname {Aut}(\Gamma)^{\ast}$ is the group of all isomorphisms and anti-isomorphisms of $\Gamma$ preserving the two sides. Our results rely on a combinatorial theorem of Nešetřil and Rödl and a strong (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The reducts of the homogeneous binary branching c-relation.Manuel Bodirsky, Peter Jonsson & Trung van Pham - 2016 - Journal of Symbolic Logic 81 (4):1255-1297.
    Download  
     
    Export citation  
     
    Bookmark   2 citations