{"entities":{"Q1225604":{"pageid":1236353,"ns":120,"title":"Item:Q1225604","lastrevid":68305287,"modified":"2026-04-12T22:48:38Z","type":"item","id":"Q1225604","labels":{"en":{"language":"en","value":"A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3510260"}},"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":"Q1225604$83DA0252-E38C-417B-9A1F-55ECAE147BD6","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c113a9d1edcd6efb83ef52b7c96de0ccc60a8d68","datavalue":{"value":{"text":"A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1225604$0CF9BB08-7691-4E1B-9639-ABD1949DC630","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"f6af97f679e150e06afc99dd5a9fcc45c55ce665","datavalue":{"value":"0326.02009","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1225604$0CBF7DBF-C6C8-4524-BF90-B7C3E0AF9100","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3bbe7a0f5ed5db28dbadd58f0671a51f03dbd8cd","datavalue":{"value":"10.1007/BF00289614","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1225604$DC233312-AD87-4CBF-8313-35E3DC62ACD9","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"7d0f02e85530cd06ceb2c58a40dc9c2e0258e194","datavalue":{"value":{"entity-type":"item","numeric-id":161641,"id":"Q161641"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1225604$BBB3B1D9-17A3-4B4F-A3F0-1066E5F6E398","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b5e8f5a4bedcdf1368f667e537d4925490c864ae","datavalue":{"value":{"time":"+1975-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":"Q1225604$CABACDA9-481C-4C2B-9CCA-E5DB17D604F6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"419d6f2b09c39920e34f63114ff159a2f0a01812","datavalue":{"value":"03B05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1225604$1D887127-ED9E-4713-9989-FF0F6A14F599","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d8724ac1f861fd4485a474d1844744a1ace24834","datavalue":{"value":"03-04","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1225604$DCABF362-7234-48DC-8980-2CBB5AAF2FBC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1e903e68a16880f66ed79a0863889f1b2d3c837c","datavalue":{"value":"94C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1225604$D159A5DC-6A63-42D9-B39C-04A2DBE30D96","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"25763a8ef2301a641eaba3b53f95161a2b4d174b","datavalue":{"value":"94-04","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1225604$6513B1F1-074E-495D-A4F8-1EE56C82B40E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"167c5c0f2e56eff852420997968ecb0ed1af5720","datavalue":{"value":"3510260","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1225604$8B62AF0D-4AAE-429E-AA8A-076A3E9CB79A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d9c99fe697c538c94aa0f22c5637bdea4b75978b","datavalue":{"value":{"entity-type":"item","numeric-id":1807672,"id":"Q1807672"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1225604$6854B71B-71A9-4FA2-B65E-C89090692E51","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b5eeb23d1e84c8e05f4abe3f1a47bd785bb37313","datavalue":{"value":{"entity-type":"item","numeric-id":1393274,"id":"Q1393274"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1225604$EE93F74B-ACDD-4EA2-A4BE-8E6F59EF6601","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":"Q1225604$BB35CE06-7C33-4B95-8F43-3BA3FB8288F1","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"88c92cbc02b207817947e66d88c5f4fd565a0f49","datavalue":{"value":{"entity-type":"item","numeric-id":5560709,"id":"Q5560709"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1225604$369769F3-DDEF-4CD4-944F-D08AE8F9ECB7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"02dc375299d87292f86f10f89b30abd5ec682a2d","datavalue":{"value":{"entity-type":"item","numeric-id":5633917,"id":"Q5633917"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1225604$D7E49221-A5B3-4713-9A77-516CD8F504EA","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7b510b4d5b539bf9e906b009dc4d8e807974a812","datavalue":{"value":"https://doi.org/10.1007/bf00289614","type":"string"},"datatype":"url"},"type":"statement","id":"Q1225604$8D5302EC-A1AE-47E3-AEE1-73E937CC6B8E","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"4a63ee32b940ce462ce7e9eee602233c95b75d5f","datavalue":{"value":"W2063412216","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1225604$D1021B39-934F-4849-B09D-8A8DAD2391EF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_branch-and-bound_algorithm_to_obtain_an_optimal_evaluation_tree_for_monotonic_Boolean_functions"}}}}}