About: Galactic algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Galactic algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdfs:label	Galactic algorithm (en)
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. (en)
dbp:wikiPageUsesTemplate	dbt:Quote dbt:Reflist dbt:Short_description
Subject	Analysis of algorithms Asymptotic analysis Mathematical notation
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Galactic_algorithm?oldid=1068751300&ns=0
Wikipage page ID	60819045 (xsd:integer)
page length (characters) of wiki page	12113 (xsd:nonNegativeInteger)
Wikipage revision ID	1068751300 (xsd:integer)
Link from a Wikipage to another Wikipage	Fourier transform NP-completeness Advanced Encryption Standard Big O notation Boolean satisfiability problem Analysis of algorithms Asymptotic analysis Mathematical notation Metric space P versus NP problem Christofides algorithm Claude Shannon Decision problem Code Communication channel Computational complexity of matrix multiplication Millennium Prize Problems Graph minor Tetration Travelling salesman problem Strassen algorithm Knuth's up-arrow notation Multiplication algorithm Richard Lipton Simulated annealing
has 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Galactic_algorithm
is Link from a Wikipage to another Wikipage of	1729 (number) AKS primality test Computational complexity of mathematical operations Computational complexity of matrix multiplication Fürer's algorithm Graph minor Matrix multiplication algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Galactic_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software