{"entities":{"Q800311":{"pageid":802159,"ns":120,"title":"Item:Q800311","lastrevid":64551963,"modified":"2026-04-11T20:39:41Z","type":"item","id":"Q800311","labels":{"en":{"language":"en","value":"A 4n-lower bound on the monotone network complexity of a one-output Boolean function"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3875158"}},"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":"Q800311$E51EF6B2-2873-4711-AD5A-71DDB5666325","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"021f74f97bc4f96d30ba5211c535a64de0cacabd","datavalue":{"value":{"text":"A 4n-lower bound on the monotone network complexity of a one-output Boolean function","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q800311$D3B14D68-6CD9-4C42-A814-1BEBFF9D8F0F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9a87b8d067e46b8619799d72ac3fca6928122c39","datavalue":{"value":"0548.94040","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q800311$F114503A-FD3D-4475-9A6F-9E36862ABB46","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e88f347f664b493e8f88238e5181ffe3a5c0739d","datavalue":{"value":"10.1016/0020-0190(84)90111-X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q800311$9521F768-EB73-47EE-92FF-EA54677FEE9B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"13b46b81333de7c274131501b41b4fc9c7ece267","datavalue":{"value":{"entity-type":"item","numeric-id":800310,"id":"Q800310"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q800311$5CD796A7-0575-4BCC-82E9-1198B0B5455D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q800311$88955488-45A8-42D4-AC6D-99E3ADD1DAA0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2ee0f220147ae8bc749a64db56839865dbc4f127","datavalue":{"value":{"time":"+1984-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":"Q800311$E18552AE-0AEE-4968-BFCE-845FBA1B25CC","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"4ac0f8c7067e2d8981da851daee86576e47bbd2b","datavalue":{"value":"In this paper a special Boolean function is defined and its lower bound of size 4n over the monotone basis is proved.","type":"string"},"datatype":"string"},"type":"statement","id":"Q800311$9A7A9F8B-096D-478C-8A08-748B04CCB063","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1e903e68a16880f66ed79a0863889f1b2d3c837c","datavalue":{"value":"94C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q800311$32765835-8F75-41D9-9673-83ED703A0C51","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a51b411076a0cfff281146691c66b1d4df2aa460","datavalue":{"value":"3875158","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q800311$709CE4AB-25F6-4AFF-B985-DF3EF6E381C6","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"15817e2375b0c03c0143d7b56cc1e0fe3f19ae80","datavalue":{"value":"threshold-k-function","type":"string"},"datatype":"string"},"type":"statement","id":"Q800311$87E65756-BFA1-4265-A1BF-4F8C2073A00E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8c2e7e64a779a85a23144d2dd60f092ee53b9a34","datavalue":{"value":"monotone network complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q800311$BDBCAAA9-5B1F-4EB7-80C5-CA0F5A5EEF00","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0062bff246f10874c360cb4d691bf5c2195f236c","datavalue":{"value":"Boolean function","type":"string"},"datatype":"string"},"type":"statement","id":"Q800311$BE840088-8A45-4470-BE00-CBC2C072B00D","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":"Q800311$87AED5FB-5C1D-40F7-B917-9AEF8DF8F361","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"b417678f234662161abddd56c663c80a97ec02d2","datavalue":{"value":{"entity-type":"item","numeric-id":3716970,"id":"Q3716970"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q800311$0B25CC26-F45F-4BCD-A222-0B5725090C22","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e4125b44bf9251c09af30dbf586bc90f092a65aa","datavalue":{"value":"https://doi.org/10.1016/0020-0190(84)90111-x","type":"string"},"datatype":"url"},"type":"statement","id":"Q800311$963434A6-57CE-416C-B9D8-051FDF28B624","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"2f904e07a45b44f1d0ebde7c6015368593a6a107","datavalue":{"value":"W2084152790","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q800311$60375A38-8E77-4C4A-A77B-A6C1BB506AA3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A 4n-lower bound on the monotone network complexity of a one-output Boolean function","badges":[]}}}}}