activity
20092023
most citedComplexity of Propositional Abduction for Restricted Sets of Boolean Functions

1 citations · 4 across the 9 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

cs.CC2014

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis

Peter Jonsson, Victor Lagerkvist, Johannes Schmidt +1

Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the…