{"entities":{"Q6761702":{"pageid":14480475,"ns":120,"title":"Item:Q6761702","lastrevid":106068155,"modified":"2026-10-22T08:52:36Z","type":"item","id":"Q6761702","labels":{"en":{"language":"en","value":"An $O(n\\log^2n)$ Algorithm for Computing Hankel Determinants up to Order $n$"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q6761702$706AB536-2572-4082-8A2E-6EE95FDB1C3E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6761702$194966F0-E962-4EB9-A964-699AF5F773DF","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"6d62aa0d44a0c9d8f32c53a2450aa810cd185abe","datavalue":{"value":"2501.05182","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6761702$656E8AA5-503B-4AEB-899E-45758043EB77","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0aaf5caa91475d51cf60571aef5a9ee227345138","datavalue":{"value":{"entity-type":"item","numeric-id":1638108,"id":"Q1638108"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6761702$07077E4D-D50C-4DD0-AED6-1D6758E0FD21","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d845b9a0574525c43349d79f9c7962bf5585bdf1","datavalue":{"value":{"entity-type":"item","numeric-id":344451,"id":"Q344451"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6761702$69C07F94-764E-42A4-A4B0-2125FFE17695","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"96f6964e9ab9587d6b01cd09a13ed4df29ddb09b","datavalue":{"value":{"entity-type":"item","numeric-id":2139083,"id":"Q2139083"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6761702$59307A3B-E247-4E61-BFDC-174DD1E0DB86","rank":"normal"}],"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6761702$2094B867-7046-4EAE-90DE-4C50058EEFD2","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6761702$868815E6-21C9-4F54-8C60-4B2C957E3515","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An $O(n\\log^2n)$ Algorithm for Computing Hankel Determinants up to Order $n$","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_$O(n%5Clog%5E2n)$_Algorithm_for_Computing_Hankel_Determinants_up_to_Order_$n$"}}}}}