{"entities":{"Q1101067":{"pageid":1111819,"ns":120,"title":"Item:Q1101067","lastrevid":66134817,"modified":"2026-04-12T07:46:41Z","type":"item","id":"Q1101067","labels":{"en":{"language":"en","value":"Complexity bounds on program realizations of Boolean functions specified in various forms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4045653"}},"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":"Q1101067$3441EF00-39D1-41E6-ACDC-56C6E0471538","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ef7ee4da7c4b54945945093f4014e3845ed5c7bc","datavalue":{"value":{"text":"Complexity bounds on program realizations of Boolean functions specified in various forms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1101067$708CAB24-956E-41C2-973B-7DBF54D8C32A","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"83413de8dce00fd0d2d6eb9e1fd40a63f7c79cb0","datavalue":{"value":"0641.94031","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101067$9E21BA64-70FA-4074-9EF3-F0AA17D3A62C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e67da383fc874096291512456841b956f23c63b1","datavalue":{"value":{"entity-type":"item","numeric-id":1054460,"id":"Q1054460"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1101067$C89466F9-B48B-4613-A9D8-A03591336E11","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"33359fd8a77e9cce0cfaf7c91dc047e11a0fed75","datavalue":{"value":{"entity-type":"item","numeric-id":109332,"id":"Q109332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1101067$01234594-E6A0-4EC8-B524-DEE221BF0A83","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5ae48c61eed19d1e1e1f33f9255d5b329362d064","datavalue":{"value":{"time":"+1987-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":"Q1101067$7D7B9AFC-5967-46C5-89FD-D5B821D4425D","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"e3216150596141a53ba8e8c48b81d9eb56453f51","datavalue":{"value":"We examine the complexity bounds on binary, k-ary, and matrix programs which represent Boolean functions specified in various forms.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101067$213517CA-A4DD-4FD3-847F-A106FB1C3487","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1e903e68a16880f66ed79a0863889f1b2d3c837c","datavalue":{"value":"94C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101067$2B64CCC3-2381-445D-9D4C-5740B20EBD25","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"7cfff2e3b7f009b69ae82e4aa296ae1902bd02ff","datavalue":{"value":"68Q60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101067$477119B4-5CF8-4892-89D6-5A6FCE9E0A90","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9b78776a56fc28cdd893baa47605a105412b838a","datavalue":{"value":"68Q45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101067$88C98E66-A985-4CFA-A51F-F516C89E7A58","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d7b4b831be02ab9c1c829f9ce43b85dcfd1f3067","datavalue":{"value":"4045653","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101067$09ADB79A-83B7-45FC-8791-F44989EF356B","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b8263c7ad9c91c4923f73c4ce92627c1d6554676","datavalue":{"value":"binary programs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101067$5964D521-6147-4C82-82BC-937D36BDEED2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"900449d9c111228b32b61aefc4917c5119284013","datavalue":{"value":"complexity bounds","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101067$3E9E5D1F-D23B-4C87-A5BA-1129C6CF045B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4cc43196b492303446d986b079a43d344cbdf545","datavalue":{"value":"matrix programs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101067$B9259DB4-23CF-4DB1-905E-D02CFF0479DC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cb5a830579b475e59eaac799be7398a9142f423b","datavalue":{"value":"Boolean functions","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101067$1FAD9B79-29B7-4E55-9587-9DE51FC6B69A","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":"Q1101067$F2687524-FFD8-4CA8-947F-B9292A938BE1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Complexity bounds on program realizations of Boolean functions specified in various forms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Complexity_bounds_on_program_realizations_of_Boolean_functions_specified_in_various_forms"}}}}}