{"entities":{"Q1144943":{"pageid":1155692,"ns":120,"title":"Item:Q1144943","lastrevid":69733401,"modified":"2026-04-13T09:01:32Z","type":"item","id":"Q1144943","labels":{"en":{"language":"en","value":"Equivalence of free Boolean graphs can be decided probabilistically in polynomial time"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3694609"}},"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":"Q1144943$6F80C201-2C6B-46C0-BCB3-5E080225FE99","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"703616dd99aa583291d4a26a64ccc7c086ddde80","datavalue":{"value":{"text":"Equivalence of free Boolean graphs can be decided probabilistically in polynomial time","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1144943$8CCB4001-C52F-4F6F-9000-F8AD552AC1B9","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"13b0dfe6678ca05bc522332beacc72dadae05e81","datavalue":{"value":"0444.68059","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1144943$7695D386-115F-4F88-8727-56F66B2510A5","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"770f4cefee86b8b8cdb2cbe43f016dc356f4de08","datavalue":{"value":"10.1016/S0020-0190(80)90078-2","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1144943$F6C9E8FE-81A1-42B9-BE0C-F826AD42C1C6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"37f94e219c650c0af69779700675fb4fbdc2fbc1","datavalue":{"value":{"entity-type":"item","numeric-id":913503,"id":"Q913503"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1144943$BBED3A13-2EC2-491D-B325-6E91320DC8F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ae84f461c84233f2e09b4cef5f407258eec8846b","datavalue":{"value":{"entity-type":"item","numeric-id":1144942,"id":"Q1144942"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1144943$D1B9FAA4-D3D2-4D33-991C-4CC07665992C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"78f88676cda884e928275ea96ed51b8eba83b4d5","datavalue":{"value":{"entity-type":"item","numeric-id":6481013,"id":"Q6481013"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1144943$BC15A97F-7008-4C27-B7EF-DF7D77235283","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":"Q1144943$494A2C09-5EB5-4C48-99DD-C0FC33D122B1","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":"Q1144943$97FAE73F-E906-4E1C-93F8-584CC1F9E3B8","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1144943$33DA02B2-AFD7-4AEC-8EFB-D57859EC438F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1144943$E0714EC4-0E09-4963-9B39-62FE0A756135","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"7cfff2e3b7f009b69ae82e4aa296ae1902bd02ff","datavalue":{"value":"68Q60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1144943$DE7B8149-95A0-4C87-A1EA-FD4CDA596404","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a84ff23b2b0d152d21173365652a8bc208bc2e1e","datavalue":{"value":"3694609","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1144943$4AB4E0CB-E9FB-4DC6-A51B-BE702BA5F8AB","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4afc251059dfa4d7139e640059f8171be6df5803","datavalue":{"value":"equivalence of free Boolean graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1144943$C0F46211-4DF8-49BC-A0C4-D161B29DA9A7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"876cf29233e581d1135b23661cc1534a760bf004","datavalue":{"value":"Ianov schemes","type":"string"},"datatype":"string"},"type":"statement","id":"Q1144943$ECCEE6B8-3814-4F6D-A60A-3709D4EEEF5D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cb5a830579b475e59eaac799be7398a9142f423b","datavalue":{"value":"Boolean functions","type":"string"},"datatype":"string"},"type":"statement","id":"Q1144943$53304723-DDC4-4393-B869-E931263A5037","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4c2155b1f0f1b7934ea2f00e74be522bfbe52774","datavalue":{"value":"directed acyclic graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1144943$FBC100DA-5548-4842-8F86-9E3A74A77CED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"075f62d463c4bf67da967198c363ae7b0537d065","datavalue":{"value":"random polynomial time","type":"string"},"datatype":"string"},"type":"statement","id":"Q1144943$E04E4BD2-498E-4E8B-A4C2-31340ED400BB","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":"Q1144943$AC215810-BA0D-4DFC-AD75-ADEA9E5A846B","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"0144faf3da4de6d410c51d8371e21d8e32667277","datavalue":{"value":{"entity-type":"item","numeric-id":4156322,"id":"Q4156322"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1144943$642CD28B-4247-4DF9-856E-90FA767E2AFE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f67782435c81856906476d249cbb89a86efd5732","datavalue":{"value":{"entity-type":"item","numeric-id":4160379,"id":"Q4160379"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1144943$A9FE66CD-721D-410F-9077-F0589CE0D3B1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5f7b60c77c0b5f89a27eaf0a201ebe8770436186","datavalue":{"value":{"entity-type":"item","numeric-id":5517672,"id":"Q5517672"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1144943$C45457EC-E458-4BC1-A311-B63D229244F8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"cda427bf3691d6d17e30eb998c33bad84c6e4597","datavalue":{"value":{"entity-type":"item","numeric-id":5732102,"id":"Q5732102"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1144943$0C80B806-AAD6-475A-B1B5-10C39A20238B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7d3e722f3ac3c2d9c7887ece9e6fec7ea2aa21ed","datavalue":{"value":"https://doi.org/10.1016/s0020-0190(80)90078-2","type":"string"},"datatype":"url"},"type":"statement","id":"Q1144943$58DA1F69-CE38-438D-ABBA-9FBA9473EBD7","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"7ee011d286046a35db00c7ca03a3d0474ff5da01","datavalue":{"value":"W2014064621","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1144943$F89D141D-FB78-4CE4-A085-1D732818ECF9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Equivalence of free Boolean graphs can be decided probabilistically in polynomial time","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Equivalence_of_free_Boolean_graphs_can_be_decided_probabilistically_in_polynomial_time"}}}}}