2412 search results - page 184 / 483 » Which Problems Have Strongly Exponential Complexity |
109
Voted
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
142
Voted
GLOBECOM
2010
IEEE
15 years 1 months ago
2010
IEEE
With a large variety of wireless access technologies available, multi-homed devices may strongly improve the performance and reliability of communication when using multiple networ...
118
Voted
PVLDB
2008
15 years 3 months ago
2008
Many approaches have been proposed to find correlations in binary data. Usually, these methods focus on pair-wise correlations. In biology applications, it is important to find co...
118
Voted
PDPTA
2000
15 years 5 months ago
2000
Abstract Design patterns are micro architectures, high-level building blocks which describe the solutions to speci c problems in software design. These solutions have generally bee...
150
Voted
TCS
2008
15 years 3 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...