About: Atlantic City algorithm

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

About: Atlantic City algorithm Goto Sponge NotDistinct Permalink

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

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.

Attributes	Values
rdf:type	software
rdfs:label	Atlantic City algorithm (en)
rdfs:comment	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)
sameAs	Atlantic City algorithm Atlantic City algorithm
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Short_description dbt:Comp-sci-theory-stub
Subject	Randomized algorithms
gold:hypernym	Algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Atlantic_City_algorithm?oldid=1068849067&ns=0
Wikipage page ID	43261640 (xsd:integer)
page length (characters) of wiki page	1433 (xsd:nonNegativeInteger)
Wikipage revision ID	1068849067 (xsd:integer)
Link from a Wikipage to another Wikipage	Algorithm Monte Carlo algorithm Randomized algorithms Time complexity Las Vegas algorithm Randomized algorithm dbr:J._Finn
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)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Atlantic_City_algorithm
is Link from a Wikipage to another Wikipage of	Monte Carlo algorithm Las Vegas algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Atlantic_City_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 (71 GB total memory, 963 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software