About: Integer complexity

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In number theory, the integer complexity of an integer is the smallest number of ones that can be used to represent it using ones and any number of additions, multiplications, and parentheses. It is always within a constant factor of the logarithm of the given integer.

Property Value
dbo:abstract
  • In number theory, the integer complexity of an integer is the smallest number of ones that can be used to represent it using ones and any number of additions, multiplications, and parentheses. It is always within a constant factor of the logarithm of the given integer. (en)
  • 在数论中， 一个整数的整数复杂度（英語：Integer complexity）是用最少数量1的算式來表達此整數，可以使用任何数量的 加法、乘法与括号，最後算式中出現1的個數即為整数复杂度。 (zh)
dbo:wikiPageID
  • 47292238 (xsd:integer)
dbo:wikiPageLength
  • 4748 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1122561424 (xsd:integer)
dbo:wikiPageWikiLink
dbp:id
  • IntegerComplexity (en)
dbp:title
  • Integer Complexity (en)
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdfs:comment
  • In number theory, the integer complexity of an integer is the smallest number of ones that can be used to represent it using ones and any number of additions, multiplications, and parentheses. It is always within a constant factor of the logarithm of the given integer. (en)
  • 在数论中， 一个整数的整数复杂度（英語：Integer complexity）是用最少数量1的算式來表達此整數，可以使用任何数量的 加法、乘法与括号，最後算式中出現1的個數即為整数复杂度。 (zh)
rdfs:label
  • Integer complexity (en)
  • 整数复杂度 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License