This HTML5 document contains 86 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n5https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-frhttp://fr.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Enumeration_algorithm
rdfs:label
Algorithme d'énumération Enumeration algorithm
rdfs:comment
Les algorithmes d’énumération sont des algorithmes qui ont pour but de calculer ou afficher une liste de toutes les réponses à un problème donné ; alors que les algorithmes « classiques » cherchent plutôt une solution (problèmes d’optimisation) ou à tester la vérité d’une affirmation (problèmes de décision).Par exemple, un algorithme listant toutes les cliques d’un graphe est un algorithme d’énumération. In computer science, an enumeration algorithm is an algorithm that enumerates the answers to a computational problem. Formally, such an algorithm applies to problems that take an input and produce a list of solutions, similarly to function problems. For each input, the enumeration algorithm must produce the list of all solutions, without duplicates, and then halt. The performance of an enumeration algorithm is measured in terms of the time required to produce the solutions, either in terms of the total time required to produce all solutions, or in terms of the maximal delay between two consecutive solutions and in terms of a preprocessing time, counted as the time before outputting the first solution. This complexity can be expressed in terms of the size of the input, the size of each indi
dcterms:subject
dbc:Algorithms
dbo:wikiPageID
60842845
dbo:wikiPageRevisionID
1121637743
dbo:wikiPageWikiLink
dbr:Clique_problem dbr:Cut_(graph_theory) dbr:Hash_table dbr:Decision_problem dbr:Conjunctive_normal_form dbr:Conjunctive_query dbr:Monadic_second-order dbr:Minimal_transversal dbr:Backtracking dbr:String_(computer_science) dbr:Monotone_dualization dbr:Linear_inequality dbr:Computational_problem dbr:Partition_(mathematics) dbr:Database_theory dbr:Alphabet_(computer_science) dbr:Self-reducible dbr:Greedoid dbr:OBDD dbr:Cartesian_product dbr:Complexity_class dbr:Enumeration dbr:Graph_theory dbr:Output-sensitive_algorithm dbr:Class_(complexity_theory) dbr:Hypergraph_(mathematics) dbc:Algorithms dbr:Disjunctive_normal_form dbr:RE_(complexity) dbr:Binary_decision_diagram dbr:System_of_equations dbr:Computer_science dbr:Constant_time dbr:Union_(set_theory) dbr:NP_(complexity) dbr:Database_query dbr:Algorithm dbr:Matroid dbr:Linear_time dbr:Witness_(mathematics) dbr:Negation_normal_form dbr:Recursively_enumerable dbr:Knowledge_compilation dbr:Computability_theory dbr:Computational_complexity_theory dbr:Polynomial_delay dbr:Vertex_enumeration_problem dbr:Boolean_circuit dbr:Bron–Kerbosch_algorithm dbr:Sorting dbr:Boolean_function dbr:Polynomial_time dbr:Boolean_satisfiability_problem dbr:Vertex_(geometry) dbr:Polytope dbr:Function_problems dbr:Independent_set_(graph_theory) dbr:Path_(graph_theory)
owl:sameAs
n5:22ePA dbpedia-fr:Algorithme_d'énumération wikidata:Q21405405
dbp:wikiPageUsesTemplate
dbt:Visible_anchor
dbo:abstract
In computer science, an enumeration algorithm is an algorithm that enumerates the answers to a computational problem. Formally, such an algorithm applies to problems that take an input and produce a list of solutions, similarly to function problems. For each input, the enumeration algorithm must produce the list of all solutions, without duplicates, and then halt. The performance of an enumeration algorithm is measured in terms of the time required to produce the solutions, either in terms of the total time required to produce all solutions, or in terms of the maximal delay between two consecutive solutions and in terms of a preprocessing time, counted as the time before outputting the first solution. This complexity can be expressed in terms of the size of the input, the size of each individual output, or the total size of the set of all outputs, similarly to what is done with output-sensitive algorithms. Les algorithmes d’énumération sont des algorithmes qui ont pour but de calculer ou afficher une liste de toutes les réponses à un problème donné ; alors que les algorithmes « classiques » cherchent plutôt une solution (problèmes d’optimisation) ou à tester la vérité d’une affirmation (problèmes de décision).Par exemple, un algorithme listant toutes les cliques d’un graphe est un algorithme d’énumération. Cette distinction est faite pour pouvoir construire des classes de complexité propres aux problèmes d’énumération. Par exemple, la classe des algorithmes d’énumérations dont le temps entre l’affichage de deux résultats est borné par un polynôme en la taille de l’entrée.
prov:wasDerivedFrom
wikipedia-en:Enumeration_algorithm?oldid=1121637743&ns=0
dbo:wikiPageLength
9056
foaf:isPrimaryTopicOf
wikipedia-en:Enumeration_algorithm
Subject Item
dbr:Output-sensitive_algorithm
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
dbr:Enumeration
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
dbr:Model_checking
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
dbr:Conjunctive_query
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
dbr:Computably_enumerable_set
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
dbr:Bron–Kerbosch_algorithm
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
dbr:Backtracking
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
dbr:Transversal_(combinatorics)
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
dbr:Pompeiu_derivative
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
dbr:Monadic_second-order_logic
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
dbr:Polynomial_delay
dbo:wikiPageWikiLink
dbr:Enumeration_algorithm
Subject Item
wikipedia-en:Enumeration_algorithm
foaf:primaryTopic
dbr:Enumeration_algorithm