215 search results - page 18 / 43 » Quantum computers that can be simulated classically in polyn... |
FOCS
1993
IEEE
13 years 12 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
RT
2005
Springer
14 years 1 months ago
2005
Springer
This paper describes a novel extension of the photon mapping algorithm, capable of handling both volume multiple inelastic scattering and curved light paths simultaneously. The ex...
WABI
2005
Springer
14 years 1 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
ENTCS
2002
13 years 7 months ago
2002
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
ACRI
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents an application of Cellular Automata in the field of dry Granular Systems modelling. While the study of granular systems is not a recent field, no efficient mo...