341 search results - page 47 / 69 » Quantum Computation and Lattice Problems |
ICALP
2003
Springer
14 years 27 days ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
CSC
2006
13 years 9 months ago
2006
How to price options efficiently and accurately is an important research problem. Options can be priced by the lattice model. Although the pricing results converge to the theoreti...
COCOON
2011
Springer
12 years 7 months ago
2011
Springer
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d−1)-dimensional faces. Enumeration of polycubes, and, in particu...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...