Results 31 to 40 of about 1,098,765 (109)

Computational Complexity of Natural Morphology Revisited

Transactions of the Association for Computational Linguistics
This paper revisits a classical, yet fundamental, discussion of theoretical computational linguistics: the computational complexity of natural languages.
Hajime Senuma, Akiko Aizawa
semanticscholar   +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

The computational complexity of linear optics [PDF]

Theory of Computing, 2010
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers.
S. Aaronson, Alexei Y. Arkhipov
semanticscholar   +1 more source

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

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

06401 Abstracts Collection -- Complexity of Constraints [PDF]

, 2006
From 01.10.06 to 06.10.06, the Dagstuhl Seminar 06401 ``Complexity of Constraints\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Creignou, Nadia, Kolaitis, Phokion, Vollmer, Heribert   +2 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

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

Computational complexity reduction techniques for quadrature Kalman filters

IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2015
Nonlinear filtering is a major problem in statistical signal processing applications and numerous techniques have been proposed in the literature. Since the seminal work that led to the Kalman filter to the more advanced particle filters, the goal has ...
P. Closas, J. Vilà‐Valls, C. Fernández-Prades   +2 more
semanticscholar   +1 more source

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