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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Galactic_algorithm
rdfs:label
Galactic algorithm
rdfs:comment
A galactic algorithm is one that outperforms any other algorithm for problems that are sufficiently large, but where "sufficiently large" is so big that the algorithm is never used in practice. Galactic algorithms were so named by Richard Lipton and Ken Regan, as they will never be used on any of the merely terrestrial data sets we find here on Earth.
dbp:wikiPageUsesTemplate
dbt:Short_description dbt:Quote dbt:Reflist
dct:subject
dbc:Analysis_of_algorithms dbc:Mathematical_notation dbc:Asymptotic_analysis
prov:wasDerivedFrom
n7:Galactic_algorithm?oldid=1068751300&ns=0
dbo:wikiPageID
60819045
dbo:wikiPageLength
12113
dbo:wikiPageRevisionID
1068751300
dbo:wikiPageWikiLink
dbr:Knuth's_up-arrow_notation dbr:Claude_Shannon dbr:P_versus_NP_problem dbr:Metric_space dbr:Strassen_algorithm dbr:Decision_problem dbr:Communication_channel dbr:Advanced_Encryption_Standard dbc:Asymptotic_analysis dbr:Richard_Lipton dbr:NP-completeness dbr:Multiplication_algorithm dbr:Graph_minor dbr:Christofides_algorithm dbc:Analysis_of_algorithms dbr:Tetration dbr:Travelling_salesman_problem dbr:Simulated_annealing dbr:Big_O_notation dbr:Millennium_Prize_Problems dbr:Code dbr:Boolean_satisfiability_problem dbc:Mathematical_notation dbr:Fourier_transform dbr:Computational_complexity_of_matrix_multiplication
dbo:abstract
A galactic algorithm is one that outperforms any other algorithm for problems that are sufficiently large, but where "sufficiently large" is so big that the algorithm is never used in practice. Galactic algorithms were so named by Richard Lipton and Ken Regan, as they will never be used on any of the merely terrestrial data sets we find here on Earth.
foaf:isPrimaryTopicOf
n7:Galactic_algorithm