<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ru.dbpedia.org/resource/\u005Cu0422\u005Cu0435\u005Cu0441\u005Cu0442_\u005Cu043F\u005Cu0440\u005Cu043E\u005Cu0441\u005Cu0442\u005Cu043E\u005Cu0442\u005Cu044B> .
<http://dbpedia.org/resource/Primality_certificate>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://uk.dbpedia.org/resource/\u005Cu0422\u005Cu0435\u005Cu0441\u005Cu0442_\u005Cu043F\u005Cu0440\u005Cu043E\u005Cu0441\u005Cu0442\u005Cu043E\u005Cu0442\u005Cu0438> .
<http://dbpedia.org/resource/Miller\u2013Rabin_primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://vi.dbpedia.org/resource/Ki\u005Cu1EC3m_tra_t\u005Cu00EDnh_nguy\u005Cu00EAn_t\u005Cu1ED1> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Jacobi_symbol> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Test pierwszo\u015Bci" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Modular_arithmetic> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"La cuesti\u00F3n de la determinaci\u00F3n de si un n\u00FAmero n dado es primo es conocida como el problema de la primalidad. Un test de primalidad (o chequeo de primalidad) es un algoritmo que, dado un n\u00FAmero de entrada n, no consigue verificar la hip\u00F3tesis de un teorema cuya conclusi\u00F3n es que n es compuesto. Esto es, un test de primalidad s\u00F3lo conjetura que \u201Cante la falta de certificaci\u00F3n sobre la hip\u00F3tesis de que n es compuesto podemos tener cierta confianza en que se trata de un n\u00FAmero primo\u201D. Esta definici\u00F3n supone un grado menor de confianza que lo que se denomina prueba de primalidad (o test verdadero de primalidad), que ofrece una seguridad matem\u00E1tica al respecto." .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Difficulty114408086> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/PrimeNumber113594302> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Experiment105798043> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Inquiry105797597> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Prime113594005> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/WikicatPrimalityTests> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/ProblemSolving105796750> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Co-NP> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/WikicatUnsolvedProblemsInMathematics> .
<http://dbpedia.org/resource/Industrial-grade_prime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedia.org/resource/Compositeness_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedia.org/resource/Primality_Testing> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Big_O_notation> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedia.org/resource/Primality_proving> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedia.org/resource/Primality_testing> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Trial105799212> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedia.org/resource/Primality_tests> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/WikicatPrimeNumbers> .
<http://dbpedia.org/resource/Paris_Kanellakis_Award>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedia.org/resource/Prime_testing> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Greatest_common_divisor> .
<http://dbpedia.org/resource/Solovay\u2013Strassen_primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Un test di primalit\u00E0 \u00E8 un algoritmo che, applicato ad un numero intero, ha lo scopo di determinare se esso \u00E8 primo. Non va confuso con un algoritmo di fattorizzazione, che invece ha lo scopo di determinare i fattori primi di un numero: quest'ultima operazione \u00E8 infatti generalmente pi\u00F9 lunga e complessa." .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Fibonacci_polynomials> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Abstraction100002137> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/DefiniteQuantity113576101> .
<http://dbpedia.org/resource/Context_of_computational_complexity>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Number113582013> .
<http://dbpedia.org/resource/Multiplicative_group_of_integers_modulo_n>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedia.org/resource/Isprime> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedia.org/resource/Detecting_primes> .
<http://dbpedia.org/resource/Number_theory>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedialite.org/things/4747268#id> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/NP_(complexity)> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedialite.org/things/6819145#id> .
<http://dbpedia.org/resource/Euler_pseudoprime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Test prvo\u010D\u00EDselnosti"@cs .
<http://dbpedia.org/resource/Pseudo-polynomial_time>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"Test prvo\u010D\u00EDselnosti je algoritmus z oboru teorie \u010D\u00EDsel, kter\u00FDm lze ur\u010Dit, zda je zadan\u00E9 p\u0159irozen\u00E9 \u010D\u00EDslo prvo\u010D\u00EDslem. Obvykle p\u0159itom tuto ot\u00E1zku zodpov\u00ED, ani\u017E by p\u0159\u00EDmo na\u0161el prvo\u010D\u00EDseln\u00FD rozklad (to je pova\u017Eov\u00E1no za podstatn\u011B n\u00E1ro\u010Dn\u011Bj\u0161\u00ED \u00FAlohu), a \u010Dasto se jedn\u00E1 o pravd\u011Bpodobnostn\u00ED algoritmy \u010Di algoritmy pou\u017Eiteln\u00E9 jen na ur\u010Dit\u00FD druh \u010D\u00EDsel. Krom\u011B algoritm\u016F, kter\u00E9 v p\u0159\u00EDpad\u011B \u00FAsp\u011Bchu prok\u00E1\u017E\u00ED, \u017Ee je \u010D\u00EDslo prvo\u010D\u00EDslem, jsou tak\u00E9 algoritmy, kter\u00E9 v p\u0159\u00EDpad\u011B \u00FAsp\u011Bchu prok\u00E1\u017E\u00ED, \u017Ee se jedn\u00E1 o slo\u017Een\u00E9 \u010D\u00EDslo \u2013 takov\u00E9 se n\u011Bkdy ozna\u010Duj\u00ED testy slo\u017Eenosti a jejich z\u0159ejm\u011B nejzn\u00E1m\u011Bj\u0161\u00EDm p\u0159\u00EDkladem je obl\u00EDben\u00FD Miller\u016Fv-Rabin\u016Fv test prvo\u010D\u00EDselnosti. Testov\u00E1n\u00ED prvo\u010D\u00EDselnosti je obecn\u011B mo\u017En\u00E9 v , co\u017E bylo prok\u00E1z\u00E1no objeven\u00EDm  v roce 2002. Jedn\u00E1 se ov\u0161em o asymptotickou slo\u017Eitost, p\u0159i praktick\u00E9m pou\u017Eit\u00ED svou rychlost\u00ED siln\u011B zaost\u00E1v\u00E1 a jsou \u010Dasto up\u0159ednost\u0148ov\u00E1ny jin\u00E9 algoritmy, by\u0165 t\u0159eba pravd\u011Bpodobnostn\u00ED."@cs .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedialite.org/things/10904744#id> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedialite.org/things/12974660#id> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedialite.org/things/26788540#id> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://fr.dbpedia.org/resource/Test_de_primalit\u005Cu00E9> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Python_(programming_language)> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://hu.dbpedia.org/resource/Pr\u005Cu00EDmteszt> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://it.dbpedia.org/resource/Test_di_primalit\u005Cu00E0> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Which> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"\u7D20\u6027\u6D4B\u8BD5\u6216\u7D20\u6570\u5224\u5B9A\uFF0C\u662F\u6AA2\u9A57\u4E00\u500B\u7D66\u5B9A\u7684\u6574\u6578\u662F\u5426\u70BA\u8CEA\u6578\u7684\u6D4B\u8BD5\u3002" .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedia.org/resource/PRIMES> .
<http://dbpedia.org/resource/Jacobi_symbol>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ar.dbpedia.org/resource/\u005Cu0627\u005Cu062E\u005Cu062A\u005Cu0628\u005Cu0627\u005Cu0631_\u005Cu0623\u005Cu0648\u005Cu0644\u005Cu064A\u005Cu0629_\u005Cu0639\u005Cu062F\u005Cu062F_\u005Cu0645\u005Cu0627> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/ZPP_(complexity)> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedialite.org/things/183751#id> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Trial_division> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedialite.org/things/184176#id> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Manindra_Agrawal> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedialite.org/things/771989#id> .
<http://dbpedia.org/resource/L-notation>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedialite.org/things/2291329#id> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://dbpedialite.org/things/3301000#id> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"\u0422\u0435\u0441\u0442 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0438 \u2014 \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C \u043F\u0435\u0440\u0435\u0432\u0456\u0440\u043A\u0438, \u0447\u0438 \u0454 \u0434\u0430\u043D\u0435 \u0447\u0438\u0441\u043B\u043E \u043F\u0440\u043E\u0441\u0442\u0438\u043C.\u0412\u0430\u0436\u043B\u0438\u0432\u043E \u043D\u0430\u0433\u043E\u043B\u043E\u0441\u0438\u0442\u0438 \u043D\u0430 \u0440\u0456\u0437\u043D\u0438\u0446\u0456 \u043C\u0456\u0436 \u0442\u0435\u0441\u0442\u0443\u0432\u0430\u043D\u043D\u044F\u043C \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0438 \u0442\u0430 \u0444\u0430\u043A\u0442\u043E\u0440\u0438\u0437\u0430\u0446\u0456\u0454\u044E \u0446\u0456\u043B\u0438\u0445 \u0447\u0438\u0441\u0435\u043B. \u0421\u0442\u0430\u043D\u043E\u043C \u043D\u0430 2009 \u0440\u0456\u043A, \u0444\u0430\u043A\u0442\u043E\u0440\u0438\u0437\u0430\u0446\u0456\u044F \u0454 \u043E\u0431\u0447\u0438\u0441\u043B\u044E\u0432\u0430\u043B\u044C\u043D\u043E \u0432\u0430\u0436\u043A\u043E\u044E \u043F\u0440\u043E\u0431\u043B\u0435\u043C\u043E\u044E, \u0432 \u0442\u043E\u0439 \u0447\u0430\u0441 \u044F\u043A \u0442\u0435\u0441\u0442\u0443\u0432\u0430\u043D\u043D\u044F \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0438 \u0454 \u043F\u043E\u0440\u0456\u0432\u043D\u044F\u043D\u043E \u043F\u0440\u043E\u0441\u0442\u0456\u0448\u0438\u043C (\u043C\u0430\u0454 \u043F\u043E\u043B\u0456\u043D\u043E\u043C\u0456\u0430\u043B\u044C\u043D\u0443 \u0441\u043A\u043B\u0430\u0434\u043D\u0456\u0441\u0442\u044C)." .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Safe_and_Sophie_Germain_primes> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Computational_complexity_theory> .
<http://dbpedia.org/resource/Prime_number>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Divisor> .
<http://dbpedia.org/resource/Adleman\u2013Pomerance\u2013Rumely_primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\u7D20\u6027\u6D4B\u8BD5\u6216\u7D20\u6570\u5224\u5B9A\uFF0C\u662F\u6AA2\u9A57\u4E00\u500B\u7D66\u5B9A\u7684\u6574\u6578\u662F\u5426\u70BA\u8CEA\u6578\u7684\u6D4B\u8BD5\u3002" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Algorithm> .
<http://dbpedia.org/resource/Pseudo-polynomial_transformation>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Probable_prime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Euler_pseudoprime> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Agrawal\u0027s_conjecture> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"\u7D20\u6570\u5224\u5B9A\uFF08\u305D\u3059\u3046\u306F\u3093\u3066\u3044\uFF09\u3068\u306F\u3001\u3042\u308B\u81EA\u7136\u6570 n \u304C\u7D20\u6570\u3067\u3042\u308B\u304B\u5408\u6210\u6570\u3067\u3042\u308B\u304B\u3092\u5224\u5B9A\u3059\u308B\u554F\u984C\u3067\u3042\u308B\u3002\u7D20\u6570\u5224\u5B9A\u3092\u884C\u3046\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306E\u3053\u3068\u3092\u7D20\u6570\u5224\u5B9A\u6CD5\u3068\u3044\u3046\u3002 RSA\u6697\u53F7\u306E\u9375\u751F\u6210\u306E\u3088\u3046\u306B\u7D20\u6570\u6027\u306E\u5224\u5B9A\u306F\u5FDC\u7528\u4E0A\u91CD\u8981\u3067\u3042\u308B\u306E\u3067\u3001\u7D20\u6570\u6027\u3092\u9AD8\u901F\u306B\u5224\u5B9A\u3059\u308B\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306F\u8A08\u7B97\u7406\u8AD6\u306B\u304A\u3044\u3066\u5F37\u3044\u95A2\u5FC3\u306E\u5BFE\u8C61\u3067\u3042\u308B\u3002 \u4EEE\u5B9A\u306A\u3057\u3067\u6C7A\u5B9A\u7684\u304B\u3064\u591A\u9805\u5F0F\u6642\u9593\u3067\u7D42\u4E86\u3059\u308B\uFF08\u30AF\u30E9\u30B9P\u306B\u542B\u307E\u308C\u308B\uFF09\u7D20\u6570\u5224\u5B9A\u6CD5\u304C\u5B58\u5728\u3059\u308B\u304B\u5426\u304B\u306F\u9577\u3089\u304F\u672A\u89E3\u6C7A\u306E\u554F\u984C\u3060\u3063\u305F\u304C\u30012002\u5E74\u306B\u305D\u306E\u3088\u3046\u306A\u7D20\u6570\u5224\u5B9A\u6CD5\u304C\u5B58\u5728\u3059\u308B\u3053\u3068\u3092\u793A\u3059\u8AD6\u6587\u304CAgrawal, Kayal, Saxena\u306B\u3088\u308A\u767A\u8868\u3055\u308C\u305F\uFF08AKS\u7D20\u6570\u5224\u5B9A\u6CD5\uFF09\u3002\u7406\u8AD6\u4E0A\u306F\u5927\u8E8D\u9032\u3067\u3042\u3063\u305F\u304C\u3001\u8A08\u7B97\u91CF\u30AA\u30FC\u30C0\u30FC\u306B\u95A2\u3057\u3066\u306F\u591A\u9805\u5F0F\u306E\u6B21\u6570\u304C\u9AD8\u304F\u3001\u5B9F\u7528\u4E0A\u306F\u306A\u3069\u306E\u307B\u3046\u304C\u9AD8\u901F\u3067\u3042\u308B\u3053\u3068\u304C\u591A\u3044\u3002 \u306A\u304A\u3001\u30E1\u30EB\u30BB\u30F3\u30CC\u6570\u306A\u3069\u7279\u6B8A\u306A\u5F62\u3092\u3057\u305F\u6570\u306B\u5BFE\u3057\u3066\u306F\u6B21\u6570\u306E\u4F4E\u3044\u591A\u9805\u5F0F\u6642\u9593\u3067\u52D5\u4F5C\u3059\u308B\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u304C\u3042\u308B\u3053\u3068\u304C\u77E5\u3089\u308C\u3066\u3044\u308B\u3002" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/L_(complexity)> .
<http://dbpedia.org/resource/Shor\u0027s_algorithm>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primitive_root_modulo_n> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/title>	"Solovay-Strassen" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Prime_number> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Adleman\u2013Pomerance\u2013Rumely_primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Probable_prime> .
<http://dbpedia.org/resource/From_Here_to_Infinity_(book)>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Multiplicative_order> .
<http://dbpedia.org/resource/Detecting_primes>	<http://dbpedia.org/ontology/wikiPageRedirects>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Test de primalidad" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Carmichael_number> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Cryptography> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Miller\u2013Rabin_primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"Een priemgetaltest is een algoritme dat bepaalt of een gegeven getal al dan niet priem is. Een dergelijke test wordt onder andere gebruikt in de cryptografie. Het verschil tussen een priemgetaltest en ontbinding in priemfactoren is dat een priemgetaltest niet noodzakelijk priemfactoren geeft, maar alleen zegt of het gegeven getal wel of niet priem is. Ontbinding in priemfactoren geeft uiteraard wel deze factoren. Het is eenvoudiger om te bepalen of een getal wel of niet priem is (aan de hand van een priemgetaltest) dan wat de priemfactoren zijn. Sommige priemgetaltests bewijzen dat een getal priem is, terwijl andere bewijzen dat een getal samengesteld is. Deze tests zouden we daarom beter samengesteldheidstests kunnen noemen." .
<http://dbpedia.org/resource/Isprime>	<http://dbpedia.org/ontology/wikiPageRedirects>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Remainder> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Coprime_integers> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Randomized_algorithm> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/WikicatAlgorithms> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Category:Primality_tests> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Category:Asymmetric-key_algorithms> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/AC0> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primorial> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Carl_Pomerance> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/AKS_primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Elliptic_curve_primality> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Analytic_number_theory> .
<http://dbpedia.org/resource/Primality_testing>	<http://dbpedia.org/ontology/wikiPageRedirects>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Baillie\u2013PSW_primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Een priemgetaltest is een algoritme dat bepaalt of een gegeven getal al dan niet priem is. Een dergelijke test wordt onder andere gebruikt in de cryptografie. Het verschil tussen een priemgetaltest en ontbinding in priemfactoren is dat een priemgetaltest niet noodzakelijk priemfactoren geeft, maar alleen zegt of het gegeven getal wel of niet priem is. Ontbinding in priemfactoren geeft uiteraard wel deze factoren. Het is eenvoudiger om te bepalen of een getal wel of niet priem is (aan de hand van een priemgetaltest) dan wat de priemfactoren zijn. Sommige priemgetaltests bewijzen dat een getal priem is, terwijl andere bewijzen dat een getal samengesteld is. Deze tests zouden we daarom beter samengesteldheidstests kunnen noemen." .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Webarchive> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Counterexample> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Activity100407535> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/NC_(complexity)> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/P_(complexity)> .
<http://dbpedia.org/resource/Primality_proving>	<http://dbpedia.org/ontology/wikiPageRedirects>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Pseudoprime> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Frobenius_pseudoprime> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"Zenbaki lehenen testa algoritmo bat da, n zenbakia emanik lehena den edo ez jakiteko erabiltzen dena. Zenbaki lehenen testarekin n zenbakia konposatua dela dioen hipotesia egiaztatzea lortzen ez bada, lehena izango dela ondorioztatzen da, konfiantza-maila jakin batekin. Bereizi behar dira zenbaki lehenen testak emandako emaitzaren konfidantza-maila eta zenbaki lehenen froga (edo zenbaki lehenen egiazko testa) egitean lortutakoarena, azken hori froga izanik erantzuna erabateko segurtasun matematikoaz ematen delako." .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Strong_pseudoprime> .
<http://dbpedia.org/resource/Primality_Testing>	<http://dbpedia.org/ontology/wikiPageRedirects>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Compositeness_test>	<http://dbpedia.org/ontology/wikiPageRedirects>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"\u0422\u0435\u0441\u0442 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0438" .
<http://dbpedia.org/resource/Prime_testing>	<http://dbpedia.org/ontology/wikiPageRedirects>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"Test pierwszo\u015Bci \u2013 algorytm okre\u015Blaj\u0105cy, czy dana liczba jest pierwsza, czy z\u0142o\u017Cona. Nie jest to r\u00F3wnowa\u017Cne znalezieniu jej rozk\u0142adu na czynniki pierwsze. W obecnej chwili (2011 rok) nie s\u0105 znane efektywne algorytmy rozk\u0142adu na czynniki pierwsze, natomiast testy pierwszo\u015Bci mo\u017Cna przeprowadza\u0107 bardzo szybko." .
<http://dbpedia.org/resource/Quantum_algorithm>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Prime_test>	<http://dbpedia.org/ontology/wikiPageRedirects>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_tests>	<http://dbpedia.org/ontology/wikiPageRedirects>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Ett primtalstest \u00E4r en algoritm som avg\u00F6r huruvida ett givet heltal n \u00E4r ett primtal, det vill s\u00E4ga inte delbart med n\u00E5got heltal f\u00F6rutom 1 och n sj\u00E4lvt. Att avg\u00F6ra huruvida ett tal \u00E4r primt \u00E4r ber\u00E4kningsm\u00E4ssigt betydligt enklare \u00E4n att faktorisera det. Denna skillnad ligger till grund f\u00F6r krypteringsalgoritmer som exempelvis RSA."@sv .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Ron_Rivest> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Cite_book> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Sample_space> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Algorithm105847438> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Rule105846932> .
<http://dbpedia.org/resource/Provable_prime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Integer_factorization> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Procedure101023820> .
<http://dbpedia.org/resource/Lucas_pseudoprime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/State100024720> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:\u0027> .
<http://dbpedia.org/resource/Paul_Leyland>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Condition113920835> .
<http://en.wikipedia.org/wiki/Primality_test>	<http://xmlns.com/foaf/0.1/primaryTopic>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Reflist> .
<http://dbpedia.org/resource/Randomized_algorithm>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://webarchive.loc.gov/all/20100806075947/http:/mathpages.com/home/kmath473.htm> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://www.excelexchange.com/prime_number_test.html> .
<http://dbpedia.org/resource/Bach\u0027s_algorithm>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"A primality test is an algorithm for determining whether an input number is prime. Among other fields of mathematics, it is used for cryptography. Unlike integer factorization, primality tests do not generally give prime factors, only stating whether the input number is prime or not. Factorization is thought to be a computationally difficult problem, whereas primality testing is comparatively easy (its running time is polynomial in the size of the input). Some primality tests prove that a number is prime, while others like Miller\u2013Rabin prove that a number is composite. Therefore, the latter might more accurately be called compositeness tests instead of primality tests." .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://www.primaboinca.com/> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Refend> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://cr.yp.to/primetests.html> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://archive.is/20121220074426/http:/computacion.cs.cinvestav.mx/~mruiz/cursos/maestria/csac.html> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://archive.org/details/computationalcom00papa> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<https://archive.org/details/computationalcom00papa/page/n230> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://en.wikipedia.org/wiki/Primality_test?oldid=984477790&ns=0> .
<http://dbpedia.org/resource/Pocklington_primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Refbegin> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/WikicatAsymmetric-keyAlgorithms> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"\u7D20\u6570\u5224\u5B9A" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Leonard_Adleman> .
<http://dbpedia.org/resource/RSA_(cryptosystem)>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Fermat\u0027s_little_theorem>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"Primeca provo estas algoritmo por kontroli \u0109u eniga nombro estas primo a\u016D komponigita. Noto ke estas grava diferenco inter provo de primeco kaj entjera faktorigo. Kiel en 2008, faktorigo estas kompute peza problemo, sed primeca provo estas kompare facila." .
<http://dbpedia.org/resource/NP_(complexity)>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\u7D20\u6570\u5224\u5B9A\uFF08\u305D\u3059\u3046\u306F\u3093\u3066\u3044\uFF09\u3068\u306F\u3001\u3042\u308B\u81EA\u7136\u6570 n \u304C\u7D20\u6570\u3067\u3042\u308B\u304B\u5408\u6210\u6570\u3067\u3042\u308B\u304B\u3092\u5224\u5B9A\u3059\u308B\u554F\u984C\u3067\u3042\u308B\u3002\u7D20\u6570\u5224\u5B9A\u3092\u884C\u3046\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306E\u3053\u3068\u3092\u7D20\u6570\u5224\u5B9A\u6CD5\u3068\u3044\u3046\u3002 RSA\u6697\u53F7\u306E\u9375\u751F\u6210\u306E\u3088\u3046\u306B\u7D20\u6570\u6027\u306E\u5224\u5B9A\u306F\u5FDC\u7528\u4E0A\u91CD\u8981\u3067\u3042\u308B\u306E\u3067\u3001\u7D20\u6570\u6027\u3092\u9AD8\u901F\u306B\u5224\u5B9A\u3059\u308B\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u306F\u8A08\u7B97\u7406\u8AD6\u306B\u304A\u3044\u3066\u5F37\u3044\u95A2\u5FC3\u306E\u5BFE\u8C61\u3067\u3042\u308B\u3002 \u4EEE\u5B9A\u306A\u3057\u3067\u6C7A\u5B9A\u7684\u304B\u3064\u591A\u9805\u5F0F\u6642\u9593\u3067\u7D42\u4E86\u3059\u308B\uFF08\u30AF\u30E9\u30B9P\u306B\u542B\u307E\u308C\u308B\uFF09\u7D20\u6570\u5224\u5B9A\u6CD5\u304C\u5B58\u5728\u3059\u308B\u304B\u5426\u304B\u306F\u9577\u3089\u304F\u672A\u89E3\u6C7A\u306E\u554F\u984C\u3060\u3063\u305F\u304C\u30012002\u5E74\u306B\u305D\u306E\u3088\u3046\u306A\u7D20\u6570\u5224\u5B9A\u6CD5\u304C\u5B58\u5728\u3059\u308B\u3053\u3068\u3092\u793A\u3059\u8AD6\u6587\u304CAgrawal, Kayal, Saxena\u306B\u3088\u308A\u767A\u8868\u3055\u308C\u305F\uFF08AKS\u7D20\u6570\u5224\u5B9A\u6CD5\uFF09\u3002\u7406\u8AD6\u4E0A\u306F\u5927\u8E8D\u9032\u3067\u3042\u3063\u305F\u304C\u3001\u8A08\u7B97\u91CF\u30AA\u30FC\u30C0\u30FC\u306B\u95A2\u3057\u3066\u306F\u591A\u9805\u5F0F\u306E\u6B21\u6570\u304C\u9AD8\u304F\u3001\u5B9F\u7528\u4E0A\u306F\u306A\u3069\u306E\u307B\u3046\u304C\u9AD8\u901F\u3067\u3042\u308B\u3053\u3068\u304C\u591A\u3044\u3002 \u306A\u304A\u3001\u30E1\u30EB\u30BB\u30F3\u30CC\u6570\u306A\u3069\u7279\u6B8A\u306A\u5F62\u3092\u3057\u305F\u6570\u306B\u5BFE\u3057\u3066\u306F\u6B21\u6570\u306E\u4F4E\u3044\u591A\u9805\u5F0F\u6642\u9593\u3067\u52D5\u4F5C\u3059\u308B\u30A2\u30EB\u30B4\u30EA\u30BA\u30E0\u304C\u3042\u308B\u3053\u3068\u304C\u77E5\u3089\u308C\u3066\u3044\u308B\u3002" .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://zh.dbpedia.org/resource/\u7D20\u6027\u6D4B\u8BD5> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://nl.dbpedia.org/resource/Priemgetaltest> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageRevisionID>	"984477790"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Factorization> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://de.dbpedia.org/resource/Primzahltest> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://www.wikidata.org/entity/Q829546> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<https://global.dbpedia.org/id/4z95h> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ru.dbpedia.org/resource/\u0422\u0435\u0441\u0442_\u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://eo.dbpedia.org/resource/Primeca_provo> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Um teste de primalidade \u00E9 um algoritmo para determinar se um dado n\u00FAmero inteiro \u00E9 primo. Este tipo de teste \u00E9 usado em \u00E1reas da matem\u00E1tica como a criptografia. Diferentemente da fatora\u00E7\u00E3o de inteiros, os testes de primalidade geralmente n\u00E3o fornecem os fatores primos, indicando apenas se o n\u00FAmero fornecido \u00E9 ou n\u00E3o primo. O problema da fatora\u00E7\u00E3o \u00E9 computacionalmente dif\u00EDcil, enquanto que os testes de primalidade s\u00E3o comparativamente mais f\u00E1ceis (o tempo de execu\u00E7\u00E3o \u00E9 polinomial no tamanho dos dados de entrada). Alguns testes de primalidade provam que um n\u00FAmero \u00E9 primo, enquanto que outros, como o  provam que um n\u00FAmero \u00E9 composto." .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://no.dbpedia.org/resource/Primtallstest> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageLength>	"25766"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://cs.dbpedia.org/resource/Test_prvo\u010D\u00EDselnosti> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Charles_E._Leiserson> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Nitin_Saxena> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Primeca provo" .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ar.dbpedia.org/resource/\u0627\u062E\u062A\u0628\u0627\u0631_\u0623\u0648\u0644\u064A\u0629_\u0639\u062F\u062F_\u0645\u0627> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Time_complexity> .
<http://dbpedia.org/resource/Complexity_class>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/P-complete> .
<http://dbpedia.org/resource/Computational_problem>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://xmlns.com/foaf/0.1/isPrimaryTopicOf>	<http://en.wikipedia.org/wiki/Primality_test> .
<http://dbpedia.org/resource/Computational_mathematics>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/List_of_IIT_Kanpur_people>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Zenbaki lehenen testa algoritmo bat da, n zenbakia emanik lehena den edo ez jakiteko erabiltzen dena. Zenbaki lehenen testarekin n zenbakia konposatua dela dioen hipotesia egiaztatzea lortzen ez bada, lehena izango dela ondorioztatzen da, konfiantza-maila jakin batekin. Bereizi behar dira zenbaki lehenen testak emandako emaitzaren konfidantza-maila eta zenbaki lehenen froga (edo zenbaki lehenen egiazko testa) egitean lortutakoarena, azken hori froga izanik erantzuna erabateko segurtasun matematikoaz ematen delako." .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Recursion> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/RP_(complexity)> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Lucas_pseudoprime> .
<http://dbpedia.org/resource/PrimePages>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Key_finding_attacks>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Test de primalit\u00E9" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Richard_Crandall> .
<http://dbpedia.org/resource/Computability>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Composite_number> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Mathematics> .
<http://dbpedia.org/resource/List_of_Indian_inventions_and_discoveries>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Witness_(disambiguation)>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\u0412\u043E\u043F\u0440\u043E\u0441 \u043E\u043F\u0440\u0435\u0434\u0435\u043B\u0435\u043D\u0438\u044F \u0442\u043E\u0433\u043E, \u044F\u0432\u043B\u044F\u0435\u0442\u0441\u044F \u043B\u0438 \u043D\u0430\u0442\u0443\u0440\u0430\u043B\u044C\u043D\u043E\u0435 \u0447\u0438\u0441\u043B\u043E  \u043F\u0440\u043E\u0441\u0442\u044B\u043C, \u0438\u0437\u0432\u0435\u0441\u0442\u0435\u043D \u043A\u0430\u043A \u043F\u0440\u043E\u0431\u043B\u0435\u043C\u0430 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B. \u0422\u0435\u0441\u0442\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B (\u0438\u043B\u0438 \u043F\u0440\u043E\u0432\u0435\u0440\u043A\u043E\u0439 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B) \u043D\u0430\u0437\u044B\u0432\u0430\u0435\u0442\u0441\u044F \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C, \u043A\u043E\u0442\u043E\u0440\u044B\u0439, \u043F\u0440\u0438\u043D\u044F\u0432 \u043D\u0430 \u0432\u0445\u043E\u0434\u0435 \u0447\u0438\u0441\u043B\u043E , \u043F\u043E\u0437\u0432\u043E\u043B\u044F\u0435\u0442 \u043B\u0438\u0431\u043E \u043D\u0435 \u043F\u043E\u0434\u0442\u0432\u0435\u0440\u0434\u0438\u0442\u044C \u043F\u0440\u0435\u0434\u043F\u043E\u043B\u043E\u0436\u0435\u043D\u0438\u0435 \u043E \u0441\u043E\u0441\u0442\u0430\u0432\u043D\u043E\u0441\u0442\u0438 \u0447\u0438\u0441\u043B\u0430, \u043B\u0438\u0431\u043E \u0442\u043E\u0447\u043D\u043E \u0443\u0442\u0432\u0435\u0440\u0436\u0434\u0430\u0442\u044C \u0435\u0433\u043E \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0443. \u0412\u043E \u0432\u0442\u043E\u0440\u043E\u043C \u0441\u043B\u0443\u0447\u0430\u0435 \u043E\u043D \u043D\u0430\u0437\u044B\u0432\u0430\u0435\u0442\u0441\u044F \u0438\u0441\u0442\u0438\u043D\u043D\u044B\u043C \u0442\u0435\u0441\u0442\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B.\u0422\u0430\u043A\u0438\u043C \u043E\u0431\u0440\u0430\u0437\u043E\u043C, \u0442\u0435\u0441\u0442 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B \u043F\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043B\u044F\u0435\u0442 \u0441\u043E\u0431\u043E\u0439 \u0442\u043E\u043B\u044C\u043A\u043E \u0433\u0438\u043F\u043E\u0442\u0435\u0437\u0443 \u043E \u0442\u043E\u043C, \u0447\u0442\u043E \u0435\u0441\u043B\u0438 \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C \u043D\u0435 \u043F\u043E\u0434\u0442\u0432\u0435\u0440\u0434\u0438\u043B \u043F\u0440\u0435\u0434\u043F\u043E\u043B\u043E\u0436\u0435\u043D\u0438\u0435 \u043E \u0441\u043E\u0441\u0442\u0430\u0432\u043D\u043E\u0441\u0442\u0438 \u0447\u0438\u0441\u043B\u0430 , \u0442\u043E \u044D\u0442\u043E \u0447\u0438\u0441\u043B\u043E \u043C\u043E\u0436\u0435\u0442 \u044F\u0432\u043B\u044F\u0442\u044C\u0441\u044F \u043F\u0440\u043E\u0441\u0442\u044B\u043C \u0441 \u043E\u043F\u0440\u0435\u0434\u0435\u043B\u0451\u043D\u043D\u043E\u0439 \u0432\u0435\u0440\u043E\u044F\u0442\u043D\u043E\u0441\u0442\u044C\u044E. \u042D\u0442\u043E \u043E\u043F\u0440\u0435\u0434\u0435\u043B\u0435\u043D\u0438\u0435 \u043F\u043E\u0434\u0440\u0430\u0437\u0443\u043C\u0435\u0432\u0430\u0435\u0442 \u043C\u0435\u043D\u044C\u0448\u0443\u044E \u0443\u0432\u0435\u0440\u0435\u043D\u043D\u043E\u0441\u0442\u044C \u0432 \u0441\u043E\u043E\u0442\u0432\u0435\u0442\u0441\u0442\u0432\u0438\u0438 \u0440\u0435\u0437\u0443\u043B\u044C\u0442\u0430\u0442\u0430 \u043F\u0440\u043E\u0432\u0435\u0440\u043A\u0438 \u0438\u0441\u0442\u0438\u043D\u043D\u043E\u043C\u0443 \u043F\u043E\u043B\u043E\u0436\u0435\u043D\u0438\u044E \u0432\u0435\u0449\u0435\u0439, \u043D\u0435\u0436\u0435\u043B\u0438 \u0438\u0441\u0442\u0438\u043D\u043D\u043E\u0435 \u0438\u0441\u043F\u044B\u0442\u0430\u043D\u0438\u0435 \u043D\u0430 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0443, \u043A\u043E\u0442\u043E\u0440\u043E\u0435 \u0434\u0430\u0451\u0442 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u0435\u0441\u043A\u0438 \u043F\u043E\u0434\u0442\u0432\u0435\u0440\u0436\u0434\u0451\u043D\u043D\u044B\u0439 \u0440\u0435\u0437\u0443\u043B\u044C\u0442\u0430\u0442." .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Cognition100023271> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Proth\u0027s_theorem> .
<http://dbpedia.org/resource/Primality_test>	<http://purl.org/dc/terms/subject>	<http://dbpedia.org/resource/Category:Primality_tests> .
<http://dbpedia.org/resource/P\u00E9pin\u0027s_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://purl.org/dc/terms/subject>	<http://dbpedia.org/resource/Category:Asymmetric-key_algorithms> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Samuel_S._Wagstaff_Jr.> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://es.dbpedia.org/resource/Test_de_primalidad> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Priemgetaltest" .
<http://dbpedia.org/resource/Freshman\u0027s_dream>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://eu.dbpedia.org/resource/Zenbaki_lehenen_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://yago-knowledge.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/title>	"Lucas Primality Test with Factored N \u2212 1" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Clifford_Stein> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://simple.dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Thomas_H._Cormen> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ja.dbpedia.org/resource/\u7D20\u6570\u5224\u5B9A> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://sv.dbpedia.org/resource/Primtalstest> .
<http://dbpedia.org/resource/Mersenne_prime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Legendre_symbol>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Fermat_pseudoprime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://rdf.freebase.com/ns/m.01932y> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://fr.dbpedia.org/resource/Test_de_primalit\u00E9> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ca.dbpedia.org/resource/Test_de_primalitat> .
<http://dbpedia.org/resource/Trial_division>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Thinking105770926> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://hu.dbpedia.org/resource/Pr\u00EDmteszt> .
<http://dbpedia.org/resource/Rebecca_Waldecker>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://gl.dbpedia.org/resource/Test_de_primalidade> .
<http://dbpedia.org/resource/Safe_and_Sophie_Germain_primes>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/List_of_algorithms>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://uk.dbpedia.org/resource/\u0422\u0435\u0441\u0442_\u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0438> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Introduction_to_Algorithms> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Sieve_of_Eratosthenes> .
<http://dbpedia.org/resource/Largest_known_prime_number>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://vi.dbpedia.org/resource/Ki\u1EC3m_tra_t\u00EDnh_nguy\u00EAn_t\u1ED1> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"Ein Primzahltest ist ein mathematisches Verfahren, um festzustellen, ob eine gegebene Zahl eine Primzahl ist oder nicht." .
<http://dbpedia.org/resource/Euler\u2013Jacobi_pseudoprime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Proth\u0027s_theorem>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://pt.dbpedia.org/resource/Teste_de_primalidade> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Primtalstest"@sv .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://it.dbpedia.org/resource/Test_di_primalit\u00E0> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://pl.dbpedia.org/resource/Test_pierwszo\u015Bci> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"Ett primtalstest \u00E4r en algoritm som avg\u00F6r huruvida ett givet heltal n \u00E4r ett primtal, det vill s\u00E4ga inte delbart med n\u00E5got heltal f\u00F6rutom 1 och n sj\u00E4lvt. Att avg\u00F6ra huruvida ett tal \u00E4r primt \u00E4r ber\u00E4kningsm\u00E4ssigt betydligt enklare \u00E4n att faktorisera det. Denna skillnad ligger till grund f\u00F6r krypteringsalgoritmer som exempelvis RSA."@sv .
<http://dbpedia.org/resource/Lucid_(programming_language)>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Teste de primalidade" .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Process105701363> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/HigherCognitiveProcess105770664> .
<http://dbpedia.org/resource/Primorial_prime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"La cuesti\u00F3n de la determinaci\u00F3n de si un n\u00FAmero n dado es primo es conocida como el problema de la primalidad. Un test de primalidad (o chequeo de primalidad) es un algoritmo que, dado un n\u00FAmero de entrada n, no consigue verificar la hip\u00F3tesis de un teorema cuya conclusi\u00F3n es que n es compuesto." .
<http://dbpedia.org/resource/Double_Mersenne_number>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/2,147,483,647>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Ein Primzahltest ist ein mathematisches Verfahren, um festzustellen, ob eine gegebene Zahl eine Primzahl ist oder nicht." .
<http://dbpedia.org/resource/Quadratic_sieve>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Lucas\u2013Lehmer\u2013Riesel_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/RSA_(cryptosystem)> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"\u0422\u0435\u0441\u0442 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B" .
<http://dbpedia.org/resource/List_of_tests>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"\u0627\u062E\u062A\u0628\u0627\u0631 \u0623\u0648\u0644\u064A\u0629 \u0639\u062F\u062F \u0645\u0627 (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: Primality test) \u0647\u0648 \u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0629 \u0645\u0646 \u0623\u062C\u0644 \u062A\u062D\u062F\u064A\u062F \u0625\u0646 \u0643\u0627\u0646 \u0639\u062F\u062F \u0637\u0628\u064A\u0639\u064A \u0645\u0627 \u0623\u0648\u0644\u064A\u0627 \u0623\u0645 \u0644\u0627."@ar .
<http://dbpedia.org/resource/Computational_complexity_of_mathematical_operations>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primitive_recursive_function>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_proving>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Solovay\u2013Strassen_primality_test> .
<http://dbpedia.org/resource/Primality_testing>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"Un test de primalit\u00E9 est un algorithme permettant de savoir si un nombre entier est premier." .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Test de primalitat" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"A primality test is an algorithm for determining whether an input number is prime. Among other fields of mathematics, it is used for cryptography. Unlike integer factorization, primality tests do not generally give prime factors, only stating whether the input number is prime or not. Factorization is thought to be a computationally difficult problem, whereas primality testing is comparatively easy (its running time is polynomial in the size of the input). Some primality tests prove that a number is prime, while others like Miller\u2013Rabin prove that a number is composite. Therefore, the latter might more accurately be called compositeness tests instead of primality tests." .
<http://dbpedia.org/resource/Compositeness_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Primeca provo estas algoritmo por kontroli \u0109u eniga nombro estas primo a\u016D komponigita. Noto ke estas grava diferenco inter provo de primeco kaj entjera faktorigo. Kiel en 2008, faktorigo estas kompute peza problemo, sed primeca provo estas kompare facila." .
<http://dbpedia.org/resource/Wilson\u0027s_theorem>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Polynomial_identity_testing>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_Testing>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_certificate> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/url>	<https://archive.is/20121220074426/http:/computacion.cs.cinvestav.mx/~mruiz/cursos/maestria/csac.html> .
<http://dbpedia.org/resource/Quadratic_Frobenius_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\u0627\u062E\u062A\u0628\u0627\u0631 \u0623\u0648\u0644\u064A\u0629 \u0639\u062F\u062F \u0645\u0627 (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: Primality test) \u0647\u0648 \u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0629 \u0645\u0646 \u0623\u062C\u0644 \u062A\u062D\u062F\u064A\u062F \u0625\u0646 \u0643\u0627\u0646 \u0639\u062F\u062F \u0637\u0628\u064A\u0639\u064A \u0645\u0627 \u0623\u0648\u0644\u064A\u0627 \u0623\u0645 \u0644\u0627."@ar .
<http://dbpedia.org/resource/Prime_testing>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Lucas_primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Zenbaki lehenen test" .
<http://dbpedia.org/resource/BPP_(complexity)>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/url>	<http://webarchive.loc.gov/all/20100806075947/http:/mathpages.com/home/kmath473.htm> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Un test de primalit\u00E9 est un algorithme permettant de savoir si un nombre entier est premier." .
<http://dbpedia.org/resource/Square-free_integer>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Lucas_primality_test> .
<http://dbpedia.org/resource/Primality_tests>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/John_Selfridge> .
<http://dbpedia.org/resource/Java_Platform,_Standard_Edition>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/date>	"2010-08-06"^^<http://www.w3.org/2001/XMLSchema#date> .
<http://dbpedia.org/resource/Prime_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Deterministic_algorithm> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/PsychologicalFeature100023100> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Pocklington_primality_test> .
<http://dbpedia.org/resource/Stanis\u0142aw_Knapowski>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Primality test" .
<http://dbpedia.org/resource/List_of_number_theory_topics>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Fermat_primality_test> .
<http://dbpedia.org/resource/List_of_computer_scientists>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Sqrt> .
<http://dbpedia.org/resource/Disquisitiones_Arithmeticae>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Lucas\u2013Lehmer_primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Encyclopedia_of_Cryptography_and_Security>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Number_theoretic_algorithms> .
<http://dbpedia.org/resource/Vaughan_Pratt>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:E> .
<http://dbpedia.org/resource/Isprime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Test di primalit\u00E0" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/wikiPageUsesTemplate>	<http://dbpedia.org/resource/Template:Math> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"\u0422\u0435\u0441\u0442 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0438 \u2014 \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C \u043F\u0435\u0440\u0435\u0432\u0456\u0440\u043A\u0438, \u0447\u0438 \u0454 \u0434\u0430\u043D\u0435 \u0447\u0438\u0441\u043B\u043E \u043F\u0440\u043E\u0441\u0442\u0438\u043C.\u0412\u0430\u0436\u043B\u0438\u0432\u043E \u043D\u0430\u0433\u043E\u043B\u043E\u0441\u0438\u0442\u0438 \u043D\u0430 \u0440\u0456\u0437\u043D\u0438\u0446\u0456 \u043C\u0456\u0436 \u0442\u0435\u0441\u0442\u0443\u0432\u0430\u043D\u043D\u044F\u043C \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0438 \u0442\u0430 \u0444\u0430\u043A\u0442\u043E\u0440\u0438\u0437\u0430\u0446\u0456\u0454\u044E \u0446\u0456\u043B\u0438\u0445 \u0447\u0438\u0441\u0435\u043B. \u0421\u0442\u0430\u043D\u043E\u043C \u043D\u0430 2009 \u0440\u0456\u043A, \u0444\u0430\u043A\u0442\u043E\u0440\u0438\u0437\u0430\u0446\u0456\u044F \u0454 \u043E\u0431\u0447\u0438\u0441\u043B\u044E\u0432\u0430\u043B\u044C\u043D\u043E \u0432\u0430\u0436\u043A\u043E\u044E \u043F\u0440\u043E\u0431\u043B\u0435\u043C\u043E\u044E, \u0432 \u0442\u043E\u0439 \u0447\u0430\u0441 \u044F\u043A \u0442\u0435\u0441\u0442\u0443\u0432\u0430\u043D\u043D\u044F \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0438 \u0454 \u043F\u043E\u0440\u0456\u0432\u043D\u044F\u043D\u043E \u043F\u0440\u043E\u0441\u0442\u0456\u0448\u0438\u043C (\u043C\u0430\u0454 \u043F\u043E\u043B\u0456\u043D\u043E\u043C\u0456\u0430\u043B\u044C\u043D\u0443 \u0441\u043A\u043B\u0430\u0434\u043D\u0456\u0441\u0442\u044C)." .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Act100030358> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Event100029378> .
<http://dbpedia.org/resource/Detecting_primes>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://primes.utm.edu/> .
<http://dbpedia.org/resource/Generation_of_primes>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/UBASIC>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/The_Art_of_Computer_Programming> .
<http://dbpedia.org/resource/Baillie\u2013PSW_primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Twin_Prime_Search>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"\u0412\u043E\u043F\u0440\u043E\u0441 \u043E\u043F\u0440\u0435\u0434\u0435\u043B\u0435\u043D\u0438\u044F \u0442\u043E\u0433\u043E, \u044F\u0432\u043B\u044F\u0435\u0442\u0441\u044F \u043B\u0438 \u043D\u0430\u0442\u0443\u0440\u0430\u043B\u044C\u043D\u043E\u0435 \u0447\u0438\u0441\u043B\u043E  \u043F\u0440\u043E\u0441\u0442\u044B\u043C, \u0438\u0437\u0432\u0435\u0441\u0442\u0435\u043D \u043A\u0430\u043A \u043F\u0440\u043E\u0431\u043B\u0435\u043C\u0430 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B. \u0422\u0435\u0441\u0442\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B (\u0438\u043B\u0438 \u043F\u0440\u043E\u0432\u0435\u0440\u043A\u043E\u0439 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B) \u043D\u0430\u0437\u044B\u0432\u0430\u0435\u0442\u0441\u044F \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C, \u043A\u043E\u0442\u043E\u0440\u044B\u0439, \u043F\u0440\u0438\u043D\u044F\u0432 \u043D\u0430 \u0432\u0445\u043E\u0434\u0435 \u0447\u0438\u0441\u043B\u043E , \u043F\u043E\u0437\u0432\u043E\u043B\u044F\u0435\u0442 \u043B\u0438\u0431\u043E \u043D\u0435 \u043F\u043E\u0434\u0442\u0432\u0435\u0440\u0434\u0438\u0442\u044C \u043F\u0440\u0435\u0434\u043F\u043E\u043B\u043E\u0436\u0435\u043D\u0438\u0435 \u043E \u0441\u043E\u0441\u0442\u0430\u0432\u043D\u043E\u0441\u0442\u0438 \u0447\u0438\u0441\u043B\u0430, \u043B\u0438\u0431\u043E \u0442\u043E\u0447\u043D\u043E \u0443\u0442\u0432\u0435\u0440\u0436\u0434\u0430\u0442\u044C \u0435\u0433\u043E \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0443. \u0412\u043E \u0432\u0442\u043E\u0440\u043E\u043C \u0441\u043B\u0443\u0447\u0430\u0435 \u043E\u043D \u043D\u0430\u0437\u044B\u0432\u0430\u0435\u0442\u0441\u044F \u0438\u0441\u0442\u0438\u043D\u043D\u044B\u043C \u0442\u0435\u0441\u0442\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B.\u0422\u0430\u043A\u0438\u043C \u043E\u0431\u0440\u0430\u0437\u043E\u043C, \u0442\u0435\u0441\u0442 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u044B \u043F\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043B\u044F\u0435\u0442 \u0441\u043E\u0431\u043E\u0439 \u0442\u043E\u043B\u044C\u043A\u043E \u0433\u0438\u043F\u043E\u0442\u0435\u0437\u0443 \u043E \u0442\u043E\u043C, \u0447\u0442\u043E \u0435\u0441\u043B\u0438 \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C \u043D\u0435 \u043F\u043E\u0434\u0442\u0432\u0435\u0440\u0434\u0438\u043B \u043F\u0440\u0435\u0434\u043F\u043E\u043B\u043E\u0436\u0435\u043D\u0438\u0435 \u043E \u0441\u043E\u0441\u0442\u0430\u0432\u043D\u043E\u0441\u0442\u0438 \u0447\u0438\u0441\u043B\u0430 , \u0442\u043E \u044D\u0442\u043E \u0447\u0438\u0441\u043B\u043E \u043C\u043E\u0436\u0435\u0442 \u044F\u0432\u043B\u044F\u0442\u044C\u0441\u044F \u043F\u0440\u043E\u0441\u0442\u044B\u043C \u0441 \u043E\u043F\u0440\u0435\u0434\u0435\u043B\u0451\u043D\u043D\u043E\u0439 \u0432\u0435\u0440\u043E\u044F\u0442\u043D\u043E\u0441\u0442\u044C\u044E. \u042D\u0442\u043E \u043E\u043F\u0440\u0435\u0434\u0435\u043B\u0435\u043D\u0438\u0435 \u043F\u043E\u0434\u0440\u0430\u0437\u0443\u043C\u0435\u0432\u0430\u0435\u0442 \u043C\u0435\u043D\u044C\u0448\u0443\u044E \u0443\u0432\u0435\u0440\u0435\u043D\u043D\u043E\u0441\u0442\u044C \u0432 \u0441\u043E\u043E\u0442\u0432\u0435\u0442\u0441\u0442\u0432\u0438\u0438 \u0440\u0435\u0437\u0443\u043B\u044C\u0442\u0430\u0442\u0430 \u043F\u0440\u043E\u0432\u0435\u0440\u043A\u0438 \u0438\u0441\u0442\u0438\u043D\u043D\u043E\u043C\u0443 \u043F\u043E\u043B\u043E\u0436\u0435\u043D\u0438\u044E \u0432\u0435\u0449\u0435\u0439, \u043D\u0435\u0436\u0435\u043B\u0438 \u0438\u0441\u0442\u0438\u043D\u043D\u043E\u0435 \u0438\u0441\u043F\u044B\u0442\u0430\u043D\u0438\u0435 \u043D\u0430 \u043F\u0440\u043E\u0441\u0442\u043E\u0442\u0443, \u043A\u043E\u0442\u043E\u0440\u043E\u0435 \u0434\u0430\u0451\u0442 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u0435\u0441\u043A\u0438 \u043F\u043E\u0434\u0442\u0432\u0435\u0440\u0436\u0434\u0451\u043D\u043D\u044B\u0439 \u0440\u0435\u0437\u0443\u043B\u044C\u0442\u0430\u0442." .
<http://dbpedia.org/resource/Monte_Carlo_method>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/2002_in_science>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Fermat_number>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"Um teste de primalidade \u00E9 um algoritmo para determinar se um dado n\u00FAmero inteiro \u00E9 primo. Este tipo de teste \u00E9 usado em \u00E1reas da matem\u00E1tica como a criptografia. Diferentemente da fatora\u00E7\u00E3o de inteiros, os testes de primalidade geralmente n\u00E3o fornecem os fatores primos, indicando apenas se o n\u00FAmero fornecido \u00E9 ou n\u00E3o primo. O problema da fatora\u00E7\u00E3o \u00E9 computacionalmente dif\u00EDcil, enquanto que os testes de primalidade s\u00E3o comparativamente mais f\u00E1ceis (o tempo de execu\u00E7\u00E3o \u00E9 polinomial no tamanho dos dados de entrada). Alguns testes de primalidade provam que um n\u00FAmero \u00E9 primo, enquanto que outros, como o  provam que um n\u00FAmero \u00E9 composto. Um dos primeiros testes de primalidade \u00E9 o crivo de Erat\u00F3stenes." .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"\u7D20\u6027\u6D4B\u8BD5" .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Fermat\u0027s_little_theorem> .
<http://dbpedia.org/resource/Pseudoprime>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Computational_complexity_theory>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Vaughan_Pratt> .
<http://dbpedia.org/resource/Riemann_hypothesis>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Fibonacci_number> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Quantum_computing> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Test prvo\u010D\u00EDselnosti je algoritmus z oboru teorie \u010D\u00EDsel, kter\u00FDm lze ur\u010Dit, zda je zadan\u00E9 p\u0159irozen\u00E9 \u010D\u00EDslo prvo\u010D\u00EDslem. Obvykle p\u0159itom tuto ot\u00E1zku zodpov\u00ED, ani\u017E by p\u0159\u00EDmo na\u0161el prvo\u010D\u00EDseln\u00FD rozklad (to je pova\u017Eov\u00E1no za podstatn\u011B n\u00E1ro\u010Dn\u011Bj\u0161\u00ED \u00FAlohu), a \u010Dasto se jedn\u00E1 o pravd\u011Bpodobnostn\u00ED algoritmy \u010Di algoritmy pou\u017Eiteln\u00E9 jen na ur\u010Dit\u00FD druh \u010D\u00EDsel. Testov\u00E1n\u00ED prvo\u010D\u00EDselnosti je obecn\u011B mo\u017En\u00E9 v , co\u017E bylo prok\u00E1z\u00E1no objeven\u00EDm  v roce 2002. Jedn\u00E1 se ov\u0161em o asymptotickou slo\u017Eitost, p\u0159i praktick\u00E9m pou\u017Eit\u00ED svou rychlost\u00ED siln\u011B zaost\u00E1v\u00E1 a jsou \u010Dasto up\u0159ednost\u0148ov\u00E1ny jin\u00E9 algoritmy, by\u0165 t\u0159eba pravd\u011Bpodobnostn\u00ED."@cs .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Generalized_Riemann_hypothesis> .
<http://dbpedia.org/resource/Decision_problem>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Shor\u0027s_algorithm> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/property/date>	"2012-12-20"^^<http://www.w3.org/2001/XMLSchema#date> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"Un test di primalit\u00E0 \u00E8 un algoritmo che, applicato ad un numero intero, ha lo scopo di determinare se esso \u00E8 primo. Non va confuso con un algoritmo di fattorizzazione, che invece ha lo scopo di determinare i fattori primi di un numero: quest'ultima operazione \u00E8 infatti generalmente pi\u00F9 lunga e complessa. Con la significativa eccezione del metodo delle curve ellittiche (noto come ECPP) e dell'algoritmo AKS, i test di primalit\u00E0 pi\u00F9 efficienti oggi utilizzati sono probabilistici, nel senso che danno una risposta certa solo quando rispondono NO (ossia quando dicono che il numero \u00E8 composto) mentre nel caso di risposta S\u00CC assicurano soltanto un limite inferiore alla probabilit\u00E0 che il numero sia primo. L'errore dei test pu\u00F2 essere per\u00F2 reso piccolo a piacere." .
<http://dbpedia.org/resource/Discrete_mathematics>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/abstract>	"La q\u00FCesti\u00F3 de determinar si un nombre donat n \u00E9s primer es coneix com el problema de la primalitat. Un test de primalitat, test de primeritat (o revisi\u00F3 de primalitat) \u00E9s un algorisme que, donat un nombre d'entrada n, no aconsegueix  la hip\u00F2tesi que n \u00E9s compost. Per tant, un test de primalitat nom\u00E9s afirma que \"davant de la falta de verificaci\u00F3 de la hip\u00F2tesi: n \u00E9s compost, es pot tenir certa  de qu\u00E8 es tracta d'un nombre primer\". Aquesta definici\u00F3 implica un grau menor de confian\u00E7a que amb una  (o test verdader de primalitat), que n'ofereix la seguretat matem\u00E0tica (confian\u00E7a=1)." .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Neeraj_Kayal> .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Wilson\u0027s_theorem> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Measure100033615> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"\u0627\u062E\u062A\u0628\u0627\u0631 \u0623\u0648\u0644\u064A\u0629 \u0639\u062F\u062F \u0645\u0627"@ar .
<http://dbpedia.org/resource/Primality_test>	<http://dbpedia.org/ontology/wikiPageID>	"183751"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://dbpedia.org/resource/Composite_number>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Problem114410605> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://zh.dbpedia.org/resource/\u005Cu7D20\u005Cu6027\u005Cu6D4B\u005Cu8BD5> .
<http://dbpedia.org/resource/Computational_number_theory>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"La q\u00FCesti\u00F3 de determinar si un nombre donat n \u00E9s primer es coneix com el problema de la primalitat. Un test de primalitat, test de primeritat (o revisi\u00F3 de primalitat) \u00E9s un algorisme que, donat un nombre d'entrada n, no aconsegueix  la hip\u00F2tesi que n \u00E9s compost. Per tant, un test de primalitat nom\u00E9s afirma que \"davant de la falta de verificaci\u00F3 de la hip\u00F2tesi: n \u00E9s compost, es pot tenir certa  de qu\u00E8 es tracta d'un nombre primer\". Aquesta definici\u00F3 implica un grau menor de confian\u00E7a que amb una  (o test verdader de primalitat), que n'ofereix la seguretat matem\u00E0tica (confian\u00E7a=1)." .
<http://dbpedia.org/resource/AKS_primality_test>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Integer_factorization>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#label>	"Primzahltest" .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://ja.dbpedia.org/resource/\u005Cu7D20\u005Cu6570\u005Cu5224\u005Cu5B9A> .
<http://dbpedia.org/resource/Elliptic_curve_primality>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://dbpedia.org/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://mpii.de/yago/resource/Primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://pl.dbpedia.org/resource/Test_pierwszo\u005Cu015Bci> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://dbpedia.org/class/yago/Attribute100024264> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://rdf.freebase.com/ns/en.primality_test> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2002/07/owl#sameAs>	<http://rdf.freebase.com/ns/guid.9202a8c04000641f8000000000148c5d> .
<http://dbpedia.org/resource/Primality_test>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Test pierwszo\u015Bci \u2013 algorytm okre\u015Blaj\u0105cy, czy dana liczba jest pierwsza, czy z\u0142o\u017Cona. Nie jest to r\u00F3wnowa\u017Cne znalezieniu jej rozk\u0142adu na czynniki pierwsze. W obecnej chwili (2011 rok) nie s\u0105 znane efektywne algorytmy rozk\u0142adu na czynniki pierwsze, natomiast testy pierwszo\u015Bci mo\u017Cna przeprowadza\u0107 bardzo szybko." .