{"entities":{"Q7361512":{"pageid":31520075,"ns":120,"title":"Item:Q7361512","lastrevid":105368048,"modified":"2026-10-07T13:37:19Z","type":"item","id":"Q7361512","labels":{"en":{"language":"en","value":"Signature-Based Gr\u00f6bner Basis Algorithms"}},"descriptions":{"en":{"language":"en","value":"AFP entry Signature_Groebner"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"ec91efa5a6c7d9b1c919c7a0f457e4902f33e8d0","datavalue":{"value":"https://isa-afp.org/entries/Signature_Groebner.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361512$C1B2C9BD-AB11-453E-8733-CA7557D54ACA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"45b0b308b892e14a056523b8ca557a64add37a38","datavalue":{"value":{"time":"+2018-09-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361512$E69CC02B-57B0-4C78-88F2-D25490175A27","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"93707b5709cca58e36d24916d591b3bc18446350","datavalue":{"value":"Alexander Maletzky","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361512$E42E84A9-E6D0-41B5-80A3-CA9C7259D6F1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"20676960dbc803fc960be1a1efdd3d44063387d4","datavalue":{"value":{"text":"Signature-Based Gr\u00f6bner Basis Algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361512$99C4C352-6DA3-4EDA-B52E-0A8FEA791997","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"0b195b117a3f10958876351a2c0cf2f22b860091","datavalue":{"value":"This article formalizes signature-based algorithms for computing Gr\u00f6bner bases. Such algorithms are, in general, superior to other algorithms in terms of efficiency, and have not been formalized in any proof assistant so far. The present development is both generic, in the sense that most known variants of signature-based algorithms are covered by it, and effectively executable on concrete input thanks to Isabelle's code generator. Sample computations of benchmark problems show that the verified implementation of signature-based algorithms indeed outperforms the existing implementation of Buchberger's algorithm in Isabelle/HOL. Besides total correctness of the algorithms, the article also proves that under certain conditions they a-priori detect and avoid all useless zero-reductions, and always return 'minimal' (in some sense) Gr\u00f6bner bases if an input parameter is chosen in the right way. The formalization follows the recent survey article by Eder and Faug\u00e8re.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361512$90FC6DF7-0BEF-4587-96F2-C42020C0732F","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"b5ee9f12c230f5d5c1a275eec4d611381485fc4e","datavalue":{"value":{"entity-type":"item","numeric-id":2963254,"id":"Q2963254"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361512$C9953D23-AA35-477A-90BE-03DB625D3D37","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"25794a903427bfb8940a26f522558323b774bce9","datavalue":{"value":{"entity-type":"item","numeric-id":1711995,"id":"Q1711995"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361512$D96A3CDB-3A74-4369-9F7E-527832BCCA1F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"477fad7e9eb44ad8a11dffc84ce40c6dfab6c50e","datavalue":{"value":{"entity-type":"item","numeric-id":1295781,"id":"Q1295781"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361512$1648D211-6434-47D4-A627-724A0F6951F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"701c6fb4caba849ee8aebaaa704d19f00dc4d28d","datavalue":{"value":{"entity-type":"item","numeric-id":5244536,"id":"Q5244536"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361512$4E4E1960-1B41-4504-A599-AA6C4F30FA4B","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361512$1DE165FA-FEBA-4142-AE24-B90E3EB963A4","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"2f60f755627fa462160b36702974759408a67214","datavalue":{"value":{"entity-type":"item","numeric-id":7361112,"id":"Q7361112"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361512$28638880-20DD-40C0-9857-B3530CB826F3","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"65292b3c42fa1bd5c21e4c91fe94fdc3f630f232","datavalue":{"value":{"entity-type":"item","numeric-id":7360821,"id":"Q7360821"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361512$D08E9F39-6263-448D-BBC8-EABE63437515","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361512$B55737AD-A1FE-4A62-811B-86A95E485569","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Signature-Based Gr\u00f6bner Basis Algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Signature-Based_Gr%C3%B6bner_Basis_Algorithms"}}}}}