@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-tel-00874599v1> a dcat:Dataset ;
    dct:description """
              We give in this thesis some moderately exponential algorithms for the MAX SAT problem. We discuss a very general method to conceive efficient exponential algorithms that give approximation scheme. In the end, we present some parameterized results for CUT problem with constrained cardinality.
            """ ;
    dct:identifier "NNT: 2013PA090008" ;
    dct:issued "2026-05-09T07:53:39.495317"^^xsd:dateTime ;
    dct:language "fr" ;
    dct:modified "2026-05-09T07:53:39.495322"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "NP-Hard problems : moderately exponential approximation and parameterized complexity" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-tel-00874599v1/resource/5c3aeb59-598d-4c02-a53f-89a952637687> ;
    dcat:keyword "approximation",
        "combinatorial-optimization",
        "complexite",
        "complexity",
        "graph-theory",
        "infoeu-reposemanticsdoctoralthesis",
        "infoinfo-ohcomputer-science-csother-csoh",
        "operational-research",
        "optimisation-combinatoire",
        "recherche-operationnelle",
        "theorie-des-graphes",
        "theses" ;
    dcat:landingPage <https://theses.hal.science/tel-00874599> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-tel-00874599v1/resource/5c3aeb59-598d-4c02-a53f-89a952637687> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-09T07:53:39.510156"^^xsd:dateTime ;
    dct:modified "2026-05-09T07:53:39.481880"^^xsd:dateTime ;
    dct:title "NP-Hard problems : moderately exponential approximation and parameterized complexity" ;
    dcat:accessURL <https://theses.hal.science/tel-00874599> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://theses.hal.science/tel-00874599> a foaf:Document .