2430 search results - page 187 / 486 » Computing Tutte Polynomials |
132
click to vote
FCT
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
107
click to vote
ECAI
1998
Springer
15 years 8 months ago
1998
Springer
The problem of minimally modifying a plan in response to changes in the specification of the planning problem has already been investigated in the literature. In this paper we cons...
130
click to vote
GD
1994
Springer
15 years 8 months ago
1994
Springer
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...
115
click to vote
DAC
1997
ACM
15 years 8 months ago
1997
ACM
This paper presents for the first time low energy simultaneous memory and register allocation. A minimum cost network flow approach is used to efficiently solve for minimum energy...
140
click to vote
DLT
2010
15 years 6 months ago
2010
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...