1199 search results - page 36 / 240 » Parameterized Proof Complexity |
146
click to vote
FSTTCS
2010
Springer
15 years 15 days ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
136
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
108
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
115
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
105
click to vote
COMBINATORICS
2002
15 years 2 months ago
2002
A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We...