About: Atlantic City algorithm     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : dbo:Software, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FAtlantic_City_algorithm

Atlantic City algorithm is a probabilistic polynomial time algorithm that answers correctly at least 75% of the time (or, in some versions, some other value greater than 50%). The term "Atlantic City" was first introduced in 1982 by in an unpublished manuscript entitled Comparison of probabilistic tests for primality.

AttributesValues
rdf:type
rdfs:label
  • Atlantic City algorithm (en)
  • Algoritmo de Atlantic City (es)
  • Algorithme d'Atlantic City (fr)
rdfs:comment
  • L'algorithme d'Atlantic City est un algorithme probabiliste en , qui répond correctement au moins 75% du temps (ou, dans certaines versions, une valeur > 50%). (fr)
  • El algoritmo de Atlantic City es un algoritmo polinomial probabilistico que contesta correctamente al menos el 75% de las veces (o, en algunas versiones diferentes, algún otro valor mayor que el 50%). El término "Atlantic City" fue introducido por primera vez en 1982 por J.Finn en un manuscrito que no se publicó titulado "Comparison of probabilistic tests for primality".​ (es)
  • Atlantic City algorithm is a probabilistic polynomial time algorithm that answers correctly at least 75% of the time (or, in some versions, some other value greater than 50%). The term "Atlantic City" was first introduced in 1982 by in an unpublished manuscript entitled Comparison of probabilistic tests for primality. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Atlantic City algorithm is a probabilistic polynomial time algorithm that answers correctly at least 75% of the time (or, in some versions, some other value greater than 50%). The term "Atlantic City" was first introduced in 1982 by in an unpublished manuscript entitled Comparison of probabilistic tests for primality. Two other common classes of probabilistic algorithms are Monte Carlo algorithms and Las Vegas algorithms. Monte Carlo algorithms are always fast, but only probably correct. On the other hand, Las Vegas algorithms are always correct, but only probably fast. The Atlantic City algorithms, which are bounded probabilistic polynomial time algorithms are probably correct and probably fast. (en)
  • L'algorithme d'Atlantic City est un algorithme probabiliste en , qui répond correctement au moins 75% du temps (ou, dans certaines versions, une valeur > 50%). (fr)
  • El algoritmo de Atlantic City es un algoritmo polinomial probabilistico que contesta correctamente al menos el 75% de las veces (o, en algunas versiones diferentes, algún otro valor mayor que el 50%). El término "Atlantic City" fue introducido por primera vez en 1982 por J.Finn en un manuscrito que no se publicó titulado "Comparison of probabilistic tests for primality".​ (es)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3332 as of Feb 27 2025, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 52 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software