2412 search results - page 115 / 483 » Which Problems Have Strongly Exponential Complexity |
243
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
138
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
136
Voted
DCG
2008
15 years 3 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
112
click to vote
BSL
2004
15 years 3 months ago
2004
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
129
Voted
CAMP
2005
IEEE
15 years 9 months ago
2005
IEEE
—All sciences, including astronomy, are now entering the era of information abundance. The exponentially increasing volume and complexity of modern data sets promises to transfor...