Matches in Wikidata for { <http://www.wikidata.org/entity/Q93201450> ?p ?o ?g. }
Showing items 1 to 44 of
44
with 100 items per page.
- Q93201450 description "artículu científicu espublizáu en xunetu de 2019" @default.
- Q93201450 description "im Juli 2019 veröffentlichter wissenschaftlicher Artikel" @default.
- Q93201450 description "scientific article published on 01 July 2019" @default.
- Q93201450 description "wetenschappelijk artikel" @default.
- Q93201450 description "наукова стаття, опублікована 1 липня 2019" @default.
- Q93201450 name "Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs" @default.
- Q93201450 name "Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs" @default.
- Q93201450 type Item @default.
- Q93201450 label "Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs" @default.
- Q93201450 label "Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs" @default.
- Q93201450 prefLabel "Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs" @default.
- Q93201450 prefLabel "Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs" @default.
- Q93201450 P1433 Q93201450-4B4D151F-551E-40E1-B494-D801D84F11F9 @default.
- Q93201450 P1476 Q93201450-B9968285-C1E4-4AB7-9974-3F7392D43178 @default.
- Q93201450 P2093 Q93201450-4728CB37-958B-4A6A-B502-3886B69FAF9D @default.
- Q93201450 P2093 Q93201450-725642BB-0FDB-44B9-9AFE-7EEFEBD8CB86 @default.
- Q93201450 P2860 Q93201450-40613618-5836-40ED-A857-6801FC068C41 @default.
- Q93201450 P304 Q93201450-0796D336-9057-4614-98A6-F30F35CF2189 @default.
- Q93201450 P31 Q93201450-726C9A93-209A-4CA8-AA14-6C5FBE9E51A4 @default.
- Q93201450 P356 Q93201450-F688A009-DE83-49DF-9A5E-2DD1B66A41CC @default.
- Q93201450 P433 Q93201450-2343C936-B565-4F45-A269-77E650B15DFC @default.
- Q93201450 P478 Q93201450-AFE6797B-803B-4AEB-B2D3-B708070F5BC7 @default.
- Q93201450 P577 Q93201450-372207C1-B3DD-4987-A8D9-CE95F198BFD9 @default.
- Q93201450 P698 Q93201450-FDADFF4F-62EC-43FD-98F8-5F02637B0495 @default.
- Q93201450 P818 Q93201450-DB5FD73B-0FAA-4ADE-BEC5-516345C87F27 @default.
- Q93201450 P819 Q93201450-23BBFF08-E6E6-49C4-8359-3D7FE18B39F0 @default.
- Q93201450 P921 Q93201450-6230BD1E-05B0-4786-BF41-F851F6EED520 @default.
- Q93201450 P356 PHYSREVE.100.013302 @default.
- Q93201450 P698 31499906 @default.
- Q93201450 P1433 Q2128181 @default.
- Q93201450 P1476 "Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs" @default.
- Q93201450 P2093 "Federico Ricci-Tersenghi" @default.
- Q93201450 P2093 "Maria Chiara Angelini" @default.
- Q93201450 P2860 Q56621902 @default.
- Q93201450 P304 "013302" @default.
- Q93201450 P31 Q13442814 @default.
- Q93201450 P356 "10.1103/PHYSREVE.100.013302" @default.
- Q93201450 P433 "1-1" @default.
- Q93201450 P478 "100" @default.
- Q93201450 P577 "2019-07-01T00:00:00Z" @default.
- Q93201450 P698 "31499906" @default.
- Q93201450 P818 "1904.02231" @default.
- Q93201450 P819 "2019PhRvE.100a3302A" @default.
- Q93201450 P921 Q910404 @default.