19320 search results - page 154 / 3864 » On the complexity of computing determinants |
138
Voted
DATE
1999
IEEE
15 years 9 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
134
click to vote
CAINE
2006
15 years 6 months ago
2006
There is a tendency to overlook or play down software issues in industrial systems design. However the very best hardware will only be as effective as the programs that control it...
132
Voted
WLP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
149
click to vote
DNA
2006
Springer
15 years 8 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
137
click to vote
ECCC
2007
15 years 5 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...