{ "items" : [
    { "id" : "http://dbpedia.org/resource/AKS_primality_test"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by  Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in a paper titled \"PRIMES is in P\". The algorithm determines whether a number is prime or composite within polynomial time."] } } }
