Trichotomy in the Complexity of Minimal Inference. Durand, A., Hermann, M., & Nordh, G. In LICS, pages 387-396, 2009. IEEE Computer Society.
Link
Paper bibtex @inproceedings{conf/lics/DurandHN09,
added-at = {2023-03-24T00:00:00.000+0100},
author = {Durand, Arnaud and Hermann, Miki and Nordh, Gustav},
biburl = {https://www.bibsonomy.org/bibtex/2aac0e0132b4a47dd1849952d97f74327/dblp},
booktitle = {LICS},
crossref = {conf/lics/2009},
ee = {https://doi.ieeecomputersociety.org/10.1109/LICS.2009.14},
interhash = {6257b098fea5a6afcb80d14615db197a},
intrahash = {aac0e0132b4a47dd1849952d97f74327},
isbn = {978-0-7695-3746-7},
keywords = {dblp},
pages = {387-396},
publisher = {IEEE Computer Society},
timestamp = {2024-04-10T20:01:26.000+0200},
title = {Trichotomy in the Complexity of Minimal Inference.},
url = {http://dblp.uni-trier.de/db/conf/lics/lics2009.html#DurandHN09},
year = 2009
}
Downloads: 0
{"_id":"X5je36Z2hNS5JSxEy","bibbaseid":"durand-hermann-nordh-trichotomyinthecomplexityofminimalinference-2009","author_short":["Durand, A.","Hermann, M.","Nordh, G."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2023-03-24T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Durand"],"firstnames":["Arnaud"],"suffixes":[]},{"propositions":[],"lastnames":["Hermann"],"firstnames":["Miki"],"suffixes":[]},{"propositions":[],"lastnames":["Nordh"],"firstnames":["Gustav"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2aac0e0132b4a47dd1849952d97f74327/dblp","booktitle":"LICS","crossref":"conf/lics/2009","ee":"https://doi.ieeecomputersociety.org/10.1109/LICS.2009.14","interhash":"6257b098fea5a6afcb80d14615db197a","intrahash":"aac0e0132b4a47dd1849952d97f74327","isbn":"978-0-7695-3746-7","keywords":"dblp","pages":"387-396","publisher":"IEEE Computer Society","timestamp":"2024-04-10T20:01:26.000+0200","title":"Trichotomy in the Complexity of Minimal Inference.","url":"http://dblp.uni-trier.de/db/conf/lics/lics2009.html#DurandHN09","year":"2009","bibtex":"@inproceedings{conf/lics/DurandHN09,\n added-at = {2023-03-24T00:00:00.000+0100},\n author = {Durand, Arnaud and Hermann, Miki and Nordh, Gustav},\n biburl = {https://www.bibsonomy.org/bibtex/2aac0e0132b4a47dd1849952d97f74327/dblp},\n booktitle = {LICS},\n crossref = {conf/lics/2009},\n ee = {https://doi.ieeecomputersociety.org/10.1109/LICS.2009.14},\n interhash = {6257b098fea5a6afcb80d14615db197a},\n intrahash = {aac0e0132b4a47dd1849952d97f74327},\n isbn = {978-0-7695-3746-7},\n keywords = {dblp},\n pages = {387-396},\n publisher = {IEEE Computer Society},\n timestamp = {2024-04-10T20:01:26.000+0200},\n title = {Trichotomy in the Complexity of Minimal Inference.},\n url = {http://dblp.uni-trier.de/db/conf/lics/lics2009.html#DurandHN09},\n year = 2009\n}\n\n","author_short":["Durand, A.","Hermann, M.","Nordh, G."],"key":"conf/lics/DurandHN09","id":"conf/lics/DurandHN09","bibbaseid":"durand-hermann-nordh-trichotomyinthecomplexityofminimalinference-2009","role":"author","urls":{"Link":"https://doi.ieeecomputersociety.org/10.1109/LICS.2009.14","Paper":"http://dblp.uni-trier.de/db/conf/lics/lics2009.html#DurandHN09"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/Durand?items=1000","dataSources":["LAXa4X86SbARduyD9"],"keywords":["dblp"],"search_terms":["trichotomy","complexity","minimal","inference","durand","hermann","nordh"],"title":"Trichotomy in the Complexity of Minimal Inference.","year":2009}