Linked Open Vocabularies

122

results

amv:hasSubproblem(amv)0.011
n/a (use in LOD)

https://w3id.org/amv#hasSubproblem

vocabulary.dcterms:description of study. It provides an in-depth description of, (a procedure or a set of rules that is followed, current time is the failure of getting relevant @en

rdfs:comment of another more inclusive problem. @en
amv:programmingLanguage(amv)0.011
n/a (use in LOD)

https://w3id.org/amv#programmingLanguage

vocabulary.dcterms:description of study. It provides an in-depth description of, (a procedure or a set of rules that is followed, current time is the failure of getting relevant @en

rdfs:comment In which all language the implementation of the algorithm/ problem is available. @en
amv:PolynomialTimeProblem(amv)0.011
n/a (use in LOD)

https://w3id.org/amv#PolynomialTimeProblem

vocabulary.dcterms:description of study. It provides an in-depth description of, (a procedure or a set of rules that is followed, current time is the failure of getting relevant @en

rdfs:comment exists for its solution such that the number of, function of n, where n corresponds to the length of the input for the problem. @en
amv:bestCaseTimeComplexity(amv)0.011
n/a (use in LOD)

https://w3id.org/amv#bestCaseTimeComplexity

vocabulary.dcterms:description of study. It provides an in-depth description of, (a procedure or a set of rules that is followed, current time is the failure of getting relevant @en

rdfs:comment Time complexity of an algorithm at least. (https://www.wikidata.org/wiki/Property:P3753) @en
amv:GraphProblem(amv)0.011
n/a (use in LOD)

https://w3id.org/amv#GraphProblem

rdfs:comment of nodes and edges. The nodes are sometimes also

vocabulary.dcterms:description of study. It provides an in-depth description of, (a procedure or a set of rules that is followed, current time is the failure of getting relevant @en
amv:libraryURI(amv)0.010
n/a (use in LOD)

https://w3id.org/amv#libraryURI

vocabulary.dcterms:description of study. It provides an in-depth description of, (a procedure or a set of rules that is followed, current time is the failure of getting relevant @en

rdfs:comment Unique identifier of the central place where the algorithm is stored. @en
amv:SetProblem(amv)0.010
n/a (use in LOD)

https://w3id.org/amv#SetProblem

vocabulary.dcterms:description of study. It provides an in-depth description of, (a procedure or a set of rules that is followed, current time is the failure of getting relevant @en

rdfs:comment Sets are collections of symbols whose order is @en
amv:OptimizationProblem(amv)0.010
n/a (use in LOD)

https://w3id.org/amv#OptimizationProblem

vocabulary.dcterms:description of study. It provides an in-depth description of, (a procedure or a set of rules that is followed, current time is the failure of getting relevant @en

rdfs:comment An optimization problem is the problem of finding @en
amv:averageTimeComplexity(amv)0.010
n/a (use in LOD)

https://w3id.org/amv#averageTimeComplexity

vocabulary.dcterms:description of study. It provides an in-depth description of, (a procedure or a set of rules that is followed, current time is the failure of getting relevant @en

rdfs:comment Time complexity of an algorithm on average @en
amv:worstCaseTimeComplexity(amv)0.010
n/a (use in LOD)

https://w3id.org/amv#worstCaseTimeComplexity

vocabulary.dcterms:description of study. It provides an in-depth description of, (a procedure or a set of rules that is followed, current time is the failure of getting relevant @en

rdfs:comment Time complexity of an algorithm at most. (https://www.wikidata.org/wiki/Property:P3752) @en

1...4 567 8...13