145 search results - page 10 / 29 » BQP and the Polynomial Hierarchy |
102
click to vote
CC
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
TCBB
2010
14 years 8 months ago
2010
— We describe a theoretical unifying framework to express comparison of RNA structures, which we call alignment hierarchy. This framework relies on the definition of common supe...
ECCC
1998
14 years 9 months ago
1998
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
AMW
2010
14 years 11 months ago
2010
In this work we present in-network techniques to improve the efficiency of spatial aggregate queries. Such queries are very common in a sensornet setting, demanding more targeted t...
ICAI
2009
14 years 7 months ago
2009
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused...