6274 search results - page 384 / 1255 » From query complexity to computational complexity |
170
click to vote
STOC
2010
ACM
16 years 4 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...
204
click to vote
ICMT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
168
click to vote
DATE
2006
IEEE
16 years 25 days ago
2006
IEEE
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
183
click to vote
ADHOCNOW
2006
Springer
16 years 23 days ago
2006
Springer
We consider an ad-hoc network consisting of devices that try to gain access for transmission through a shared communication channel. We redesign randomized protocol of Cai, Lu and ...
180
click to vote
JSSPP
2005
Springer
16 years 8 days ago
2005
Springer
There are many choices to make when evaluating the performance of a complex system. In the context of parallel job scheduling, one must decide what workload to use and what measur...