Linked Open Vocabularies

122

results

amv:ComputationalGeometryProblem(amv)0.023
n/a (use in LOD)

https://w3id.org/amv#ComputationalGeometryProblem

rdfs:comment Computational geometry is a branch of computer, science devoted to the study of algorithms which can, be stated in terms of geometry. Some purely

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:averageSpaceComplexity(amv)0.019
n/a (use in LOD)

https://w3id.org/amv#averageSpaceComplexity

rdfs:comment Space complexity of an algorithm on average

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:pub_Discipline(amv)0.018
n/a (use in LOD)

https://w3id.org/amv#pub_Discipline

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 A branch of knowledge.,Academic field of study or profession. @en
amv:pub_rating(amv)0.018
n/a (use in LOD)

https://w3id.org/amv#pub_rating

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 Rating given on the basis of usefulness of a thing. @en
amv:inputDescription(amv)0.018
n/a (use in LOD)

https://w3id.org/amv#inputDescription

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 Input description of an algorithm. @en
amv:SpaceComplexity(amv)0.018
n/a (use in LOD)

https://w3id.org/amv#SpaceComplexity

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 Space complexity of an algorithm quantifies the, amount of space or memory taken by an algorithm to, run as a function of the length of the input. @en
amv:hasImplementation(amv)0.017
n/a (use in LOD)

https://w3id.org/amv#hasImplementation

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 The various applications of the algorithm. @en
amv:bestCaseSpaceComplexity(amv)0.017
n/a (use in LOD)

https://w3id.org/amv#bestCaseSpaceComplexity

rdfs:comment Space complexity of an algorithm at least.(https://www.wikidata.org/wiki/Property:P3756)

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:worstCaseSpaceComplexity(amv)0.017
n/a (use in LOD)

https://w3id.org/amv#worstCaseSpaceComplexity

rdfs:comment Space complexity of an algorithm at most.(https://www.wikidata.org/wiki/Property:P3755)

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:alternativeTitle(amv)0.016
n/a (use in LOD)

https://w3id.org/amv#alternativeTitle

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 alternative title of a resource. @en

1 2 345 6...13