Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
A relatively longstanding question in algorithmic randomness is Jan Reimann's question whether there is a Turing cone of broken dimension. That is, is there a real A such that...
: We investigate weighted automata with discounting and their behaviours over semirings and finitely generated graded monoids. We characterize the discounted behaviours of weighted...
: Reference Counting is the memory management technique of most widespread use today. Very often applications handle objects that are either permanent or get tenured. This paper us...