2412 search results - page 31 / 483 » Which Problems Have Strongly Exponential Complexity |
SAT
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
112
Voted
EUROSYS
2006
ACM
15 years 9 months ago
2006
ACM
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
124
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
85
Voted
DEXA
2008
Springer
15 years 2 months ago
2008
Springer
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
105
Voted
AAAI
2006
15 years 2 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...