19320 search results - page 32 / 3864 » On the complexity of computing determinants |
116
Voted
CORR
2007
Springer
15 years 16 days ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
104
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
130
Voted
FOSSACS
2007
Springer
15 years 4 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
101
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
100
click to vote
ECAIW
2000
Springer
15 years 4 months ago
2000
Springer
This paper discusses the hierarchical control architecture used to generate the behavior of individual agents and a team of robots for the RoboCup Small Size competition. Our react...