RT @CCS_donders: When NP-hard just isn’t hard enough for you, check out the @DBicgroup ‘s work on intractability higher up in the complexit…
SOFSEM 2011: Theory and Practice of Computer Science
Springer Berlin Heidelberg
RT @CCS_donders: When NP-hard just isn’t hard enough for you, check out the @DBicgroup ‘s work on intractability higher up in the complexit…
RT @CCS_donders: When NP-hard just isn’t hard enough for you, check out the @DBicgroup ‘s work on intractability higher up in the complexit…
RT @DBicgroup: The reason for the latter is that we have no obvious certificate to check that an explanation is within the first k explanat…
When NP-hard just isn’t hard enough for you, check out the @DBicgroup ‘s work on intractability higher up in the complexity hierarchy. #Bayesian #structure #approximation