{"_id":"WTZ4HuymwFyr3Kq9w","bibbaseid":"park-complexityresultsandapproximationstrategiesformapexplanations-2004","authorIDs":[],"author_short":["Park, J."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Park"],"firstnames":["JD"],"suffixes":[]}],"title":"Complexity results and approximation strategies for MAP explanations","journal":"Journal of Artificial Intelligence Research","volume":"","number":"","pages":"","year":"2004","abstract":"Abstract MAP is the problem of finding a most probable instantiation of a set of variables given evidence. MAP has always been perceived to be significantly harder than the related problems of computing the probability of a variable instantiation (Pr), or the problem of computing.","location":"","keywords":"","bibtex":"@Article{Park2004,\nauthor = {Park, JD}, \ntitle = {Complexity results and approximation strategies for MAP explanations}, \njournal = {Journal of Artificial Intelligence Research}, \nvolume = {}, \nnumber = {}, \npages = {}, \nyear = {2004}, \nabstract = {Abstract MAP is the problem of finding a most probable instantiation of a set of variables given evidence. MAP has always been perceived to be significantly harder than the related problems of computing the probability of a variable instantiation (Pr), or the problem of computing.}, \nlocation = {}, \nkeywords = {}}\n\n\n","author_short":["Park, J."],"key":"Park2004","id":"Park2004","bibbaseid":"park-complexityresultsandapproximationstrategiesformapexplanations-2004","role":"author","urls":{},"downloads":0},"bibtype":"article","biburl":"https://gist.githubusercontent.com/stuhlmueller/a37ef2ef4f378ebcb73d249fe0f8377a/raw/6f96f6f779501bd9482896af3e4db4de88c35079/references.bib","creationDate":"2020-01-27T02:13:34.691Z","downloads":0,"keywords":[],"search_terms":["complexity","results","approximation","strategies","map","explanations","park"],"title":"Complexity results and approximation strategies for MAP explanations","year":2004,"dataSources":["hEoKh4ygEAWbAZ5iy"]}