{"entities":{"Q6946491":{"pageid":21182523,"ns":120,"title":"Item:Q6946491","lastrevid":75970365,"modified":"2026-04-22T08:46:45Z","type":"item","id":"Q6946491","labels":{"en":{"language":"en","value":"A better-than-\\(3n\\) lower bound for the circuit complexity of an explicit function"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8076517"}},"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":"Q6946491$E3FDB545-8D39-4A42-BF69-FC53DEAB19F4","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"44ef0deda5393ccb7dfbaec542e0b6018a7719da","datavalue":{"value":{"text":"A better-than-\\(3n\\) lower bound for the circuit complexity of an explicit function","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6946491$C328445A-F236-4959-8D15-5D723402B305","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"eb69df0e14b615687490618a4f3dc8130adc1b5b","datavalue":{"value":"10.1109/FOCS.2016.19","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946491$1B73F239-EDD4-46CE-88FA-7FBC90E381EA","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"409d1f9a4834ec23dc9b67676ce40a7d95cdf9bd","datavalue":{"value":{"entity-type":"item","numeric-id":725953,"id":"Q725953"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6946491$A33883F1-08DF-4C25-9A65-8DEB5FF2BC2B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4e707bcf134ba3ae3304daf45c62c892088161ea","datavalue":{"value":{"entity-type":"item","numeric-id":1635508,"id":"Q1635508"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6946491$B895CB07-2255-4D76-963B-8988E0DCED2F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"063157bf65bc20e92e5fe70d62bf6e86c4c12861","datavalue":{"value":{"entity-type":"item","numeric-id":1625134,"id":"Q1625134"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6946491$9329DEDE-AD2C-4D98-BEEA-51443A6681A6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"082fc9f964d52bb224385bf2fb43b8343199b054","datavalue":{"value":{"entity-type":"item","numeric-id":234710,"id":"Q234710"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6946491$391FB617-DB33-4B63-83D1-61167481B637","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"92e52dd11d4a4a87e99ca1dd58ff5812f369c9fa","datavalue":{"value":{"time":"+2025-08-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6946491$CE8F5688-4012-4175-9F59-7CFFE58CD7D2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946491$08BBDAB4-5DE4-41B3-AA10-2377191C433C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946491$119F4425-720C-439F-AAC3-108D9E1786B4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946491$1F1AE12B-824B-43D3-A24F-D8DAEA4C3D8F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"60f6d5c1342dfd6cc7ec144f13eef469588b4a3f","datavalue":{"value":"8076517","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946491$FFCC3169-4A3C-4A89-8FE5-1BE517ADD655","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":"Q6946491$AC1CCFF8-9351-4BF9-B2F1-F0B0F8FC5584","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A better-than-\\(3n\\) lower bound for the circuit complexity of an explicit function","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_better-than-%5C(3n%5C)_lower_bound_for_the_circuit_complexity_of_an_explicit_function"}}}}}