88 search results - page 7 / 18 » On the Complexity of Matroid Isomorphism Problems |
119
click to vote
ACL
2011
14 years 5 months ago
2011
We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment component...
127
click to vote
STACS
1992
Springer
15 years 5 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
121
Voted
JCP
2006
15 years 1 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
113
Voted
DAM
2006
15 years 1 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
105
click to vote
COCOON
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...