This HTML5 document contains 48 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/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
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/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Loopless_algorithm
rdf:type
yago:PsychologicalFeature100023100 yago:Procedure101023820 yago:WikicatCombinatorialAlgorithms dbo:Software yago:Abstraction100002137 yago:Event100029378 yago:Act100030358 yago:Algorithm105847438 yago:Activity100407535 yago:YagoPermanentlyLocatedEntity yago:Rule105846932
rdfs:label
Loopless algorithm
rdfs:comment
In computational combinatorics, a loopless algorithm or loopless imperative algorithm is an imperative algorithm that generates successive combinatorial objects, such as partitions, permutations, and combinations, in constant time and the first object in linear time. The objects must be immediately available in simple form without requiring any additional steps.
dcterms:subject
dbc:Combinatorial_algorithms
dbo:wikiPageID
23722890
dbo:wikiPageRevisionID
994258819
dbo:wikiPageWikiLink
dbr:Linear_time dbr:Combination dbr:Algorithm dbr:Imperative_programming dbc:Combinatorial_algorithms dbr:Functional_programming dbr:Combinatorics dbr:Richard_Bird_(computer_scientist) dbr:Anamorphism dbr:Subroutine dbr:Constant_time dbr:Partition_of_a_set dbr:Permutation
owl:sameAs
wikidata:Q6675889 freebase:m.06zqsv1 yago-res:Loopless_algorithm n18:4qof5
dbp:wikiPageUsesTemplate
dbt:Combin-stub dbt:Reflist
dbo:abstract
In computational combinatorics, a loopless algorithm or loopless imperative algorithm is an imperative algorithm that generates successive combinatorial objects, such as partitions, permutations, and combinations, in constant time and the first object in linear time. The objects must be immediately available in simple form without requiring any additional steps. A loopless functional algorithm is a functional algorithm that takes the form unfoldr step • prolog where step takes constant time and prolog takes linear time in the size of the input. The standard function unfoldr is a right-associative Bird unfold.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Loopless_algorithm?oldid=994258819&ns=0
dbo:wikiPageLength
2299
foaf:isPrimaryTopicOf
wikipedia-en:Loopless_algorithm
Subject Item
dbr:Steinhaus–Johnson–Trotter_algorithm
dbo:wikiPageWikiLink
dbr:Loopless_algorithm
Subject Item
dbr:Loopless
dbo:wikiPageWikiLink
dbr:Loopless_algorithm
dbo:wikiPageRedirects
dbr:Loopless_algorithm
Subject Item
dbr:Loopless_functional_algorithm
dbo:wikiPageWikiLink
dbr:Loopless_algorithm
dbo:wikiPageRedirects
dbr:Loopless_algorithm
Subject Item
dbr:Loopless_imperative_algorithm
dbo:wikiPageWikiLink
dbr:Loopless_algorithm
dbo:wikiPageRedirects
dbr:Loopless_algorithm
Subject Item
wikipedia-en:Loopless_algorithm
foaf:primaryTopic
dbr:Loopless_algorithm