排序方式: 共有2条查询结果,搜索用时 15 毫秒
1
1.
2.
Petr Hlineny 《Theory of Computing Systems》2007,41(3):551-562
Spikes form an interesting class of 3-connected matroids of branch-width 3. We show that some computational problems are hard
on spikes with given matrix representations over infinite fields. Namely, the question whether a given spike is the free spike
is co-NP-hard (though the property itself is definable in monadic second-order logic); and the task to compute the Tutte polynomial
of a spike is #P-hard (even though that can be solved efficiently on all matroids of bounded branch-width which are represented
over a finite field). 相似文献
1