This HTML5 document contains 23 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/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
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#
n6http://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Atlantic_City_algorithm
rdf:type
dbo:Software
rdfs:label
Atlantic City algorithm
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.
owl:sameAs
yago-res:Atlantic_City_algorithm freebase:m.0114dx6x
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Short_description dbt:Comp-sci-theory-stub
dct:subject
dbc:Randomized_algorithms
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
n6:Atlantic_City_algorithm?oldid=1068849067&ns=0
dbo:wikiPageID
43261640
dbo:wikiPageLength
1433
dbo:wikiPageRevisionID
1068849067
dbo:wikiPageWikiLink
dbr:Algorithm dbr:Monte_Carlo_algorithm dbc:Randomized_algorithms dbr:J._Finn dbr:Las_Vegas_algorithm dbr:Time_complexity dbr:Randomized_algorithm
dbo: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.
foaf:isPrimaryTopicOf
n6:Atlantic_City_algorithm