{"entities":{"Q689110":{"pageid":690959,"ns":120,"title":"Item:Q689110","lastrevid":63497127,"modified":"2026-04-11T13:33:53Z","type":"item","id":"Q689110","labels":{"en":{"language":"en","value":"Polynomial factorization: Sharp bounds, efficient algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 440044"}},"aliases":{},"claims":{"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":"Q689110$F1385B04-4C0D-4F18-8CBE-13934817753F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d89beb89c55894a8138d6c22d1424418d087cfde","datavalue":{"value":{"text":"Polynomial factorization: Sharp bounds, efficient algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q689110$5F7730DB-D518-4950-880B-3C03D315244B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7d1cd84904a56b3d95de0bece2cb68ca298a502b","datavalue":{"value":"0801.12007","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q689110$1313EDF8-6B64-4AD3-AE14-94E39833C78F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4d9c66e80e36b3ca20a721c7b7f1e60bff1889af","datavalue":{"value":{"entity-type":"item","numeric-id":181375,"id":"Q181375"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q689110$C962A6D2-DDB4-4039-B9CB-CB0756652B4D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2fc6903e4063ffc4464801f44d4590f4b4833ffa","datavalue":{"value":{"entity-type":"item","numeric-id":307804,"id":"Q307804"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q689110$933021A1-62C7-4AEC-8683-BCD069FE5A9C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a6cce360ab4e5985ad5378da21e62062ef6d0ba0","datavalue":{"value":{"entity-type":"item","numeric-id":689108,"id":"Q689108"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q689110$07A1FFEE-4DFE-4C31-838A-C15F5B6EEB53","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"ea72303f92787da89554ee5fa15621068821a762","datavalue":{"value":{"entity-type":"item","numeric-id":99061,"id":"Q99061"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q689110$8AA62F1D-539F-4687-B1F1-52FA31303FCE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2efffe4403698391fc762bc2b9596a2e102d8aed","datavalue":{"value":{"time":"+1993-12-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q689110$4D3441C1-3519-42CC-956F-2602804A7F78","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"c555e320f3dfe5442b21399bf07505d3484a748d","datavalue":{"value":"The paper shows that, in order to realize fast algorithms, it is necessary to control the size of the coefficients in one irreducible factor. A bound on this size is presented in Theorem 1. It makes use of the weighted norm and it is almost optimal. The paper shows how to use this bound in the process of \\(p\\)-adic lifting in such a way to obtain an efficient algorithm. A worked example completes the paper.","type":"string"},"datatype":"string"},"type":"statement","id":"Q689110$C7609DA8-FD06-480F-BA94-22062BE53708","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"661c831991cdebd51f9465b74d929024bd00f373","datavalue":{"value":"12Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q689110$FFDAF8F9-CEAB-4A5C-B1CF-DC5219E51759","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"134db59e1dd21b74810139030592980e5f363e0f","datavalue":{"value":"13P05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q689110$74E22CBC-7D04-4A56-A6F8-C4EBB971ED49","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q689110$75410219-C77F-4734-BD71-7C3B6C4B1B02","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4d379f1f3728661c9d77f930d729b891dd925754","datavalue":{"value":"11Y40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q689110$18197657-C933-4BD5-8996-B75415EE4A62","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6be78f1bad1f2f19058dbde65eb124c0430a7d27","datavalue":{"value":"68W30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q689110$04890F9B-A456-4742-9B29-F74361EA00F0","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3d7e066a340ddfbe049dadc49b4f0ea604b57e2f","datavalue":{"value":"440044","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q689110$1E241641-DB99-4CF4-8C7A-023321C5D6FE","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e2b7e51b71905e4dce2b85d86bd11add2afd0ad5","datavalue":{"value":"polynomial factorization","type":"string"},"datatype":"string"},"type":"statement","id":"Q689110$0A2E3E73-E7B3-426E-AC5D-7B4D2DC0907E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8d9bd9bc1369f5038bf80a14023721b93736a30d","datavalue":{"value":"\\(p\\)-adic lifting","type":"string"},"datatype":"string"},"type":"statement","id":"Q689110$5DCCA0B1-567E-48AD-8986-AF184987EA14","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4364d21acd66d915b62f94bfe69e0065826249a1","datavalue":{"value":"efficient algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q689110$E31568F0-F1BF-4884-8F7E-261592C5C94F","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"5fcc27165c862a5ef1ec75521d8377579f0b8990","datavalue":{"value":{"entity-type":"item","numeric-id":911791,"id":"Q911791"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q689110$B09AC762-E8B4-4743-8DD8-CE77BE13FA56","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":"Q689110$CB084919-4245-48D6-B096-EFE3620B9072","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"b481a386c9edc8bb3e06c82871c0e9c92fb32a34","datavalue":{"value":"https://doi.org/10.1006/jsco.1993.1028","type":"string"},"datatype":"url"},"type":"statement","id":"Q689110$F545A3A5-BA28-428D-AA12-42E981594690","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"b3d915e0b95742c7f081e118a34695cbe06e5c53","datavalue":{"value":"W2052120705","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q689110$63B221CD-DC77-42EF-8585-13658BC20A8C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"02321ee5938692335867b93a4c435be5daac2abc","datavalue":{"value":"10.1006/JSCO.1993.1028","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q689110$FDF879EA-63A8-4180-BFAF-A997718AA1FC","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"45d4a1afc5e454ed1d0a61546b6015c42d9de1f7","datavalue":{"value":{"entity-type":"item","numeric-id":1396437,"id":"Q1396437"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"58641d1ead54e3f4ef832d6776b715392710063d","datavalue":{"value":{"amount":"+0.7932680249214172","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q689110$4B68CA0F-2591-4D6F-9131-2C5A9FFA59B9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2b888d29bb152aa4b8fbbdd60529cf61fa9f2780","datavalue":{"value":{"entity-type":"item","numeric-id":2739443,"id":"Q2739443"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"143456b6765bc9c0399c2ca52ec6e8f6ad13274a","datavalue":{"value":{"amount":"+0.7812714576721191","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q689110$66A20A09-1247-451A-8276-3277CAD5338D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0d8fdd509482bd0fae136d9b5570f46ebd45f134","datavalue":{"value":{"entity-type":"item","numeric-id":3801671,"id":"Q3801671"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"143456b6765bc9c0399c2ca52ec6e8f6ad13274a","datavalue":{"value":{"amount":"+0.7812714576721191","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q689110$4811162A-8411-4938-B0BD-7A336B0BDA7F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a222132d8dddb2bf3793e588956833bf878c2005","datavalue":{"value":{"entity-type":"item","numeric-id":4892927,"id":"Q4892927"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"686b9b6533d2798444863e2a7da1ef231ca7fd15","datavalue":{"value":{"amount":"+0.7796936631202698","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q689110$508A06B9-16B3-48FD-94CB-30429EFC8C0B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"093b1b25dfaf4d3ca156ae894bb62805d880a263","datavalue":{"value":{"entity-type":"item","numeric-id":1074651,"id":"Q1074651"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"97b8233fb4e04664fd688be3ec01aa475ddf37d3","datavalue":{"value":{"amount":"+0.7794507145881653","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q689110$64D35592-0CC0-470C-A087-6B751A2A7142","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Polynomial factorization: Sharp bounds, efficient algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Polynomial_factorization:_Sharp_bounds,_efficient_algorithms"}}}}}