375 citations · 494 across the 29 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011
Succinct Representations of Permutations and Functions
J. Ian Munro, Rajeev Raman, Venkatesh Raman +1
We investigate the problem of succinctly representing an arbitrary permutation, π, on {0,...,n-1} so that π^k(i) can be computed quickly for any i and any (positive or negative) in…
cs.CC2011★ 1 cited
Parameterized Complexity of MaxSat Above Average
Robert Crowston, Gregory Gutin, Mark Jones +2
In MaxSat, we are given a CNF formula with variables and clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let be th…