Results 31 to 40 of about 279,119 (104)

Quantum Certificate Complexity [PDF]

, 2002
Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate complexity RC(f) and the quantum certificate complexity QC(f). Using Ambainis' adversary method, we exactly characterize QC(f)
Aaronson, Scott
core   +6 more sources

Biased random satisfiability problems: From easy to hard instances

, 2005
In this paper we study biased random K-SAT problems in which each logical variable is negated with probability $p$. This generalization provides us a crossover from easy to hard problems and would help us in a better understanding of the typical ...
A. Ramezanpour, C. H. Papadimitriou, S. Cook, S. Moghimi-Araghi   +3 more
core   +1 more source

Post-Quantum Cryptography: S381 Cyclic Subgroup of High Order

, 2017
Currently there is an active Post-Quantum Cryptography (PQC) solutions search, which attempts to find cryptographic protocols resistant to attacks by means of for instance Shor polynomial time algorithm for numerical field problems like integer ...
Hecht, Pedro
core   +1 more source

Minimizing energy below the glass thresholds

, 2004
Focusing on the optimization version of the random K-satisfiability problem, the MAX-K-SAT problem, we study the performance of the finite energy version of the Survey Propagation (SP) algorithm.
A. J. Parkes, A. K. Hartmann, A. K. Hartmann, A. Kaporis, A. Z. Broder, B. Selman, C. H. Papadimitriou, D. Achlioptas, Demian Battaglia, F. R. Kschischang, H. Karlo, J.-P. Bouchaud, M. R. Garey, Michal Kolář, O. Dubois, R. Motwani, Riccardo Zecchina, T. Richardson   +17 more
core   +1 more source

Addendum to computational complexity and black hole horizons [PDF]

, 2014
In this addendum to [arXiv:1402.5674] two points are discussed. In the first additional evidence is provided for a dual connection between the geometric length of an Einstein‐Rosen bridge and the computational complexity of the quantum state of the dual ...
L. Susskind
semanticscholar   +1 more source

The Communication Complexity of the Hamming Distance Problem

, 2005
We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two n-bit strings is no less than a threshold d.
Ambainis, Ambainis, Bar-Yossef, Buhrman, Gavinsky, Kalyanasundaram, Kushilevitz, Newman, Razborov, Razborov, Shengyu Zhang, Wei Huang, Yaoyun Shi, Yufan Zhu   +13 more
core   +1 more source

Intrinsic universality and the computational power of self-assembly

, 2013
This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models.
Woods, Damien
core   +2 more sources

Survey Propagation as local equilibrium equations

, 2004
It has been shown experimentally that a decimation algorithm based on Survey Propagation (SP) equations allows to solve efficiently some combinatorial problems over random graphs.
Aldous D, Alfredo Braunstein, Barthel W Hartmann A K, Berrou C Glavieux A Thitimajshima P, Braunstein A Mezard M Weigt M Zecchina R, Braunstein A Mezard M Zecchina R, Braunstein A Napolano V Zecchina R, Cook S A, Dubois O, Gallager R G, Mezard M, Mezard M, Mezard M, Mezard M, Montanari A Parisi G Ricci-Tersenghi F, Nishimori H, Parisi G, Parisi G, Pearl J, Riccardo Zecchina, Sourlas N, Spielman D A, Yedidia J S   +22 more
core   +1 more source

New quantum algorithm for studying NP-complete problems

, 2003
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems.
Accardi, Bernstein, Bouwmeester, Deutsch, Ekert, Gardiner, Garey, Igor V. Volovich, Masanori Ohya, Ohya, Ohya, Ohya, Schack, Shor   +13 more
core   +1 more source

Clustering of solutions in the random satisfiability problem

, 2005
Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other.
D. Achlioptas, David J. C. MacKay, G. Semerjian, M. Mézard, R. Zecchina, Robert G. Gallagher, S. Kirkpatrick, Stephen Cook, T. Mora   +8 more
core   +1 more source