{ "items" : [
    { "id" : "http://dbpedia.org/resource/Integer_factorization"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "In number theory, integer factorization is the decomposition of a composite number into a product of smaller integers. If these integers are further restricted to prime numbers, the process is called prime factorization.When the numbers are very large, no efficient, non-quantum integer factorization algorithm is known; an effort by several researchers concluded in 2009, factoring a 232-digit number (RSA-768), utilizing hundreds of machines over a span of two years." ] ,
        "http://www.w3.org/2000/01/rdf-schema#seeAlso" : [ "http://dbpedia.org/resource/Integer_factorization_records" ] ,
        "http://xmlns.com/foaf/0.1/depiction" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/PrimeDecompositionExample.svg" ] ,
        "http://dbpedia.org/ontology/thumbnail" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/PrimeDecompositionExample.svg?width=300"] } } }
