{"entities":{"Q1270418":{"pageid":1281168,"ns":120,"title":"Item:Q1270418","lastrevid":68343492,"modified":"2026-04-12T23:04:40Z","type":"item","id":"Q1270418","labels":{"en":{"language":"en","value":"Probabilistic methods for algorithmic discrete mathematics"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1214166"}},"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":"Q1270418$498D4C38-975A-4CA5-B6BE-39B154CAB5BA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"593ee27ea0cc274d700b4de4203046a6c43b956b","datavalue":{"value":{"text":"Probabilistic methods for algorithmic discrete mathematics","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1270418$C5499D59-6B4C-4236-BE60-03230B54F3D8","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"31c745d5d8a3e97ccbec9ee442be1ff6c0e87950","datavalue":{"value":"0898.00019","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1270418$BF062892-3EF0-4BC7-AFDC-289161FFE5B7","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"eb47045ef7e96d0b4d987b862aaa480b015cf63c","datavalue":{"value":{"entity-type":"item","numeric-id":194853,"id":"Q194853"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1270418$D09A5C0C-6DF4-49AA-AA57-2C3C65950528","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"90426ea62347459d821a0e1637190e2bbd62c47a","datavalue":{"value":{"time":"+1998-10-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1270418$79CBEDAE-BC7C-4768-961A-C0D2DB8F6091","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"e85f085af23569aa8325b686592d80e5daca92b6","datavalue":{"value":"The articles of this volume will be reviewed individually.  Indexed articles:  \\textit{Molloy, Michael}, The probabilistic method, 1-35 [Zbl 0918.05092]  \\textit{Frieze, Alan M.; Reed, Bruce}, Probabilistic analysis of algorithms, 36-92 [Zbl 0980.65153]  \\textit{Motwani, Rajeev; Raghavan, Prabhakar}, An overview of randomized algorithms, 93-115 [Zbl 0916.68070]  \\textit{Jerrum, Mark}, Mathematical foundations of the Markov chain Monte Carlo method, 116-165 [Zbl 0920.65001]  \\textit{Welsh, Dominic}, Percolation and the random cluster model: Combinatorial and algorithmic problems, 166-194 [Zbl 0916.60085]  \\textit{McDiarmid, Colin}, Concentration, 195-248 [Zbl 0927.60027]  \\textit{Devroye, Luc}, Branching processes and their applications in the analysis of tree structures and tree algorithms, 249-314 [Zbl 0924.60077]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1270418$390AAD74-3188-40ED-92C2-D3C28CBE8C8E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"342a6161f41187e2c595daa41b09cee10ab1ace9","datavalue":{"value":"00B15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1270418$C0D56329-B833-4727-BC6F-38065F20656D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1270418$D84A3A55-7481-4079-87D3-8DC47A19C1A1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"226655afee1bf0bb32eee240ec2948137df408df","datavalue":{"value":"60-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1270418$BC90609A-862A-4702-BBD9-7C594E481AFA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"c2375fd4b32d2eb23df347253ca68f523c20922c","datavalue":{"value":"05-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1270418$9A46330A-992D-4ECB-A23D-9D3F43D64A4E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d3ec607f89996e54fc58c51413475a750afa7cba","datavalue":{"value":"1214166","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1270418$6380FC8E-3D1D-4749-8119-F907B10E6503","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5b6044a4bde5c0770c122bdd4f3f939c403c9987","datavalue":{"value":"Probabilistic methods","type":"string"},"datatype":"string"},"type":"statement","id":"Q1270418$3576EDEF-0E56-4A39-A587-EAC072D5926B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"02bf9c2c9fd7d80d862508255d05e61599bc562a","datavalue":{"value":"Algorithmic discrete mathematics","type":"string"},"datatype":"string"},"type":"statement","id":"Q1270418$A9E9B6BA-65B7-45B8-9A79-7788D8160288","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":"Q1270418$F9F66C3A-4CF2-4B56-A769-4746C02E7B38","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Probabilistic methods for algorithmic discrete mathematics","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Probabilistic_methods_for_algorithmic_discrete_mathematics"}}}}}