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

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

Namespace Prefixes

PrefixIRI
dbpedia-dehttp://de.dbpedia.org/resource/
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n7https://global.dbpedia.org/id/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Output-sensitive_algorithm
rdf:type
dbo:Software
rdfs:label
Ausgabesensitiver Algorithmus Output-sensitive algorithm
rdfs:comment
In computer science, an output-sensitive algorithm is an algorithm whose running time depends on the size of the output, instead of, or in addition to, the size of the input. For certain problems where the output size varies widely, for example from linear in the size of the input to quadratic in the size of the input, analyses that take the output size explicitly into account can produce better runtime bounds that differentiate algorithms that would otherwise have identical asymptotic complexity. In der Informatik ist ein ausgabesensitiver Algorithmus ein Algorithmus, dessen Laufzeit von der Größe der Ausgabe abhängt, anstatt oder zusätzlich zur Größe der Eingabe.
dcterms:subject
dbc:Analysis_of_algorithms dbc:Articles_with_example_Python_(programming_language)_code
dbo:wikiPageID
12127990
dbo:wikiPageRevisionID
1085295999
dbo:wikiPageWikiLink
dbr:Computer_science dbr:Algorithm dbr:Computational_geometry dbr:Convex_hull dbr:Convex_hull_algorithms dbr:Voronoi_diagram dbr:Long_division dbr:Enumeration_algorithm dbr:Chan's_algorithm dbr:Division_algorithm dbc:Articles_with_example_Python_(programming_language)_code dbr:Ultimate_convex_hull_algorithm dbr:Range_filter dbr:Hidden_surface_removal dbr:Graham_scan dbr:Lazy_evaluation dbr:Big_O_notation dbc:Analysis_of_algorithms
owl:sameAs
n7:4t53Y wikidata:Q7112860 dbpedia-de:Ausgabesensitiver_Algorithmus freebase:m.02vqq12
dbo:abstract
In computer science, an output-sensitive algorithm is an algorithm whose running time depends on the size of the output, instead of, or in addition to, the size of the input. For certain problems where the output size varies widely, for example from linear in the size of the input to quadratic in the size of the input, analyses that take the output size explicitly into account can produce better runtime bounds that differentiate algorithms that would otherwise have identical asymptotic complexity. In der Informatik ist ein ausgabesensitiver Algorithmus ein Algorithmus, dessen Laufzeit von der Größe der Ausgabe abhängt, anstatt oder zusätzlich zur Größe der Eingabe.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Output-sensitive_algorithm?oldid=1085295999&ns=0
dbo:wikiPageLength
4432
foaf:isPrimaryTopicOf
wikipedia-en:Output-sensitive_algorithm