{"entities":{"Q1142030":{"pageid":1152779,"ns":120,"title":"Item:Q1142030","lastrevid":66229734,"modified":"2026-04-12T08:24:59Z","type":"item","id":"Q1142030","labels":{"en":{"language":"en","value":"A 3n-lower bound on the network complexity of Boolean functions"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3684894"}},"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":"Q1142030$53F09F03-BD1D-4714-B9D9-6D5874CED546","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1cddcea59cc4f9a4e4fd066221ddfa7ce8a1dd21","datavalue":{"value":{"text":"A 3n-lower bound on the network complexity of Boolean functions","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1142030$12A450F6-4B3C-4A25-8031-CF63C70B6B07","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"102ab480c55ef0317af1f8d7771ee81e7080cb84","datavalue":{"value":"0438.68012","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1142030$651D5504-846D-488E-90D6-377015A16953","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"edcf64197286eba84162ce707a68da6eca81bb59","datavalue":{"value":"10.1016/0304-3975(80)90074-2","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1142030$92CE24AF-BA62-4B38-94FD-1A863597E17B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6c42738f9deefec75387e9d359812a8128eb9442","datavalue":{"value":{"entity-type":"item","numeric-id":1126892,"id":"Q1126892"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1142030$CC4B86BA-7ED6-4834-BF91-BDAC11BBF294","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f3c424cd94a60f9664f9fb69cc6027e75cc7ff3f","datavalue":{"value":{"entity-type":"item","numeric-id":123643,"id":"Q123643"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1142030$10F6CBE0-9F58-42EF-B79D-35C133EF917B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"56afe75e154439409929c71e0e459d1542811b6e","datavalue":{"value":{"time":"+1980-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":"Q1142030$AF2D041F-27A9-4714-9580-EABAC7C44714","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1142030$C648B5F1-1BD0-41DF-ACF7-572492309CE5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1e903e68a16880f66ed79a0863889f1b2d3c837c","datavalue":{"value":"94C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1142030$F7A8C9BC-D970-4A00-89E5-C4C767D0805B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1e58cf0d15202ddbb43ad7d4c2631f25ce8a5cf3","datavalue":{"value":"3684894","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1142030$4DB7763C-AE38-4E65-8727-A71DB69EC2B9","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c9e3b265c3d831485d0c3382221401d77b13509d","datavalue":{"value":"network complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q1142030$133DDE9B-11BE-48C4-BF69-5B45E14096B3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"45e309a96074ab4fd2fa0bdb64dc210a828af107","datavalue":{"value":"lowerbound","type":"string"},"datatype":"string"},"type":"statement","id":"Q1142030$CB7694A9-9C42-4ABA-BB84-965A577D9FB5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cb5a830579b475e59eaac799be7398a9142f423b","datavalue":{"value":"Boolean functions","type":"string"},"datatype":"string"},"type":"statement","id":"Q1142030$EC605371-9F7E-413C-A5DC-E0CBE0AAB58F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6dcad60f83001e6407554566033a355d8e30f549","datavalue":{"value":"unrestricted binary networks","type":"string"},"datatype":"string"},"type":"statement","id":"Q1142030$92ADC9A6-D9DE-41BF-B074-98C8F6182B8B","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":"Q1142030$AFCFCB80-A356-4203-831E-1E40663CE2B2","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"59d5760a1acad4db5f4558aa7f8492a2d784d762","datavalue":{"value":"https://doi.org/10.1016/0304-3975(80)90074-2","type":"string"},"datatype":"url"},"type":"statement","id":"Q1142030$55F88AE1-5368-4F84-92CA-98C08196E4E2","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"897418bf9b9a310fad34a6fb78f045afcf497bf1","datavalue":{"value":"W2045766836","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1142030$27340D86-6C56-440C-AE86-4E2941E85240","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"7ef9971a2f6713840b0c1b29ded43c53c543b20d","datavalue":{"value":"Q126439203","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1142030$F6415A53-C31D-4D55-9F67-4003B5DA9E94","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"2e266c332c8c722703a0d32ad33eb1d65fa4f734","datavalue":{"value":{"entity-type":"item","numeric-id":4131019,"id":"Q4131019"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1142030$2779852D-7C48-4FC5-A865-DE44AB3DC4E7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b4ab13142076117cc14856c9cfe9c081eaaa2f9d","datavalue":{"value":{"entity-type":"item","numeric-id":4172915,"id":"Q4172915"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1142030$81420C39-F579-4250-BE98-9ABF1E4C4B66","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"6036bf43f265b8908f5fed788c1a5dda8ab233cc","datavalue":{"value":{"entity-type":"item","numeric-id":1220384,"id":"Q1220384"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1142030$B8D60800-51E5-4FC5-902F-7D5CF7A278A3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d7af518f21abbf673f84ab6d1aa24c3c52eef081","datavalue":{"value":{"entity-type":"item","numeric-id":1230622,"id":"Q1230622"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1142030$4A80B326-B326-4974-A437-7EA70A850981","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7cebd8eb2f5a77bc77e1ec5c5bf27647529b62ed","datavalue":{"value":{"entity-type":"item","numeric-id":1228356,"id":"Q1228356"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1142030$DD1F7CAA-A7DD-487D-9F93-C56892D2041E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5003f1b35a3d8f903232f84c855b80979eec5e4f","datavalue":{"value":{"entity-type":"item","numeric-id":3888985,"id":"Q3888985"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1142030$40F3F6FC-88B0-416C-A581-917F26DCF82E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8c7753b2c0a0136d36e0e6594c32ff134628ef23","datavalue":{"value":{"entity-type":"item","numeric-id":4146674,"id":"Q4146674"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1142030$7514FBA7-CB7B-462C-860A-CAFCF27BA463","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A 3n-lower bound on the network complexity of Boolean functions","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_3n-lower_bound_on_the_network_complexity_of_Boolean_functions"}}}}}