{"entities":{"Q1164028":{"pageid":1174777,"ns":120,"title":"Item:Q1164028","lastrevid":67013472,"modified":"2026-04-12T14:19:42Z","type":"item","id":"Q1164028","labels":{"en":{"language":"en","value":"Bounds on the realization complexity of Boolean formulas by tree circuits of tunable modules"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3761959"}},"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":"Q1164028$6F6496D3-EEC3-4279-B4F8-D6CDB8FA33D9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e1edbe2868c44a29842652f122ef6133a3429df2","datavalue":{"value":{"text":"Bounds on the realization complexity of Boolean formulas by tree circuits of tunable modules","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1164028$137C6610-ED1C-43C6-B5E6-01D6CBEB438B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"5678d5fef2d4f65d79f7cb6fa3eb7dcf2593094b","datavalue":{"value":"0484.94042","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1164028$5CB13570-A4CA-44B5-B3F6-96990534F265","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c1660945c2d830e107dd0d64a08204d241b7e694","datavalue":{"value":{"entity-type":"item","numeric-id":1058503,"id":"Q1058503"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1164028$87363E38-3F10-45F7-A4D4-67317B358884","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"31045095062cc4001cf252244f7863361d235394","datavalue":{"value":{"entity-type":"item","numeric-id":1164027,"id":"Q1164027"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1164028$53E37B58-6CF1-41C9-8927-7B8E61BC22D6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"042e626c6e4ede7bfcee17c7abf7ede76fd7918e","datavalue":{"value":{"entity-type":"item","numeric-id":334219,"id":"Q334219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1164028$27EBFE97-BB9C-49E5-85CB-BDCAB87BD6CA","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":"Q1164028$A309588C-44EE-4D64-A46F-1E1487E93745","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"50fad0db7dc87cb4e51866acdb5ccbaa54ec857b","datavalue":{"value":{"time":"+1981-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":"Q1164028$C3153CE1-4710-4B54-9021-53F5A3406931","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1e903e68a16880f66ed79a0863889f1b2d3c837c","datavalue":{"value":"94C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1164028$D9B0AB5B-4400-4BB1-94E9-727CEAF2852D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3ce2a85bbf7c4838de978be93341d80f0f1a7042","datavalue":{"value":"3761959","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1164028$1EE73725-255A-4B2F-AADB-7F628291CEAB","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"58d2d693c746175c6fe746ed25a747d2636a9c99","datavalue":{"value":"circuit realization complexity of Boolean formulas","type":"string"},"datatype":"string"},"type":"statement","id":"Q1164028$6ABF7647-4A5A-4133-9715-AB88CFC9ABCB","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":"Q1164028$A63947DF-DCF1-4895-AF38-9764CA2B2535","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Bounds on the realization complexity of Boolean formulas by tree circuits of tunable modules","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Bounds_on_the_realization_complexity_of_Boolean_formulas_by_tree_circuits_of_tunable_modules"}}}}}