A tractable syntactic class

dc.contributorGUILLEN GALVAN, CARLOS; 78563
dc.creatorCarranza Cisneros, Ángeles
dc.date.accessioned2020-09-09T23:14:45Z
dc.date.accessioned2022-09-26T13:48:07Z
dc.date.available2020-09-09T23:14:45Z
dc.date.available2022-09-26T13:48:07Z
dc.date.created2020-09-09T23:14:45Z
dc.date.issued2018-06
dc.identifierhttps://hdl.handle.net/20.500.12371/7702
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3552255
dc.description.abstract"The organization of the thesis is as follows. Chapter 1 contains a review of basic concepts on graph theory and boolean expressions. Important de nitions are stated and some relevant examples are presented. Next, in Chapter 2, a super cial description of complexity theory and syntactic classes is explored. Also, hypergraphs are introduced and examples of notions related to hypertree decomposition are detailed."
dc.languageeng
dc.publisherBenemérita Universidad Autónoma de Puebla
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.rightsopenAccess
dc.titleA tractable syntactic class
dc.typeTesis de licenciatura


Este ítem pertenece a la siguiente institución