Efficient Approximations of Conjunctive Queries Pablo Barcel´o1 1 Leonid Libkin2

First Page		Document Content
Date: 2015-01-08 10:43:54 Tree decomposition Complexity classes Conjunctive query Graph homomorphism Hypergraph Hypercube graph Structure FO Graph theory Theoretical computer science Mathematics		Efficient Approximations of Conjunctive Queries Pablo Barcel´o1 1 Leonid Libkin2 Add to Reading List Source URL: homepages.inf.ed.ac.uk Download Document from Source Website File Size: 518,27 KB Share Document on Facebook

	CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS STRUCTURE AND COMPLEXITY DocID: 1r79Q - View Document
	The homomorphism order Constrained homomorphisms Locally constrained homomorphism orders Constrained homomorphism orders Jan Hubiˇcka DocID: 1r6wl - View Document
	Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel Paulusma DocID: 1r6iz - View Document
	CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS LOCALLY INJECTIVE HOMOMORPHISMS DocID: 1r5we - View Document
	A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar DocID: 1r2yt - View Document