Zobrazeno 1 - 10
of 15 711
pro vyhledávání: '"Exponential complexity"'
Autor:
Legrand, Alexandre, Maillard, Pascal
The continuous random energy model (CREM) is a Gaussian process indexed by a binary tree of depth $T$, introduced by Derrida and Spohn, then Bovier and Kurkova, as a toy model of a spin glass. Addario-Berry and the second author have established the
Externí odkaz:
http://arxiv.org/abs/2402.04917
Autor:
Schuh, Bernd R.
The study of regular linear conjunctive normal form (LCNF) formulas is of interest because exact satisfiability (XSAT) is known to be NP-complete for this class of formulas. In a recent paper it was shown that the subclass of regular exact LCNF formu
Externí odkaz:
http://arxiv.org/abs/1812.09110
Publikováno v:
In Information and Computation August 2018 261 Part 1:55-77
Autor:
Pan, Feng
In this paper the reason why entropy reduction (negentropy) can be used to measure the complexity of any computation was first elaborated both in the aspect of mathematics and informational physics. In the same time the equivalence of computation and
Externí odkaz:
http://arxiv.org/abs/1412.1229
Autor:
Hen, Itay, Young, A. P.
Publikováno v:
Phys. Rev. E 84, 061152 (2011)
We determine the complexity of several constraint satisfaction problems using the quantum adiabatic algorithm in its simplest implementation. We do so by studying the size dependence of the gap to the first excited state of "typical" instances. We fi
Externí odkaz:
http://arxiv.org/abs/1109.6872
Autor:
Montina, Alberto
Publikováno v:
Phys. Rev. A 77, 022104 (2008)
Ontological theories of quantum mechanics describe a single system by means of well-defined classical variables and attribute the quantum uncertainties to our ignorance about the underlying reality represented by these variables. We consider the gene
Externí odkaz:
http://arxiv.org/abs/0711.4770
Autor:
Znidaric, Marko, Horvat, Martin
Publikováno v:
Phys.Rev.A. 73, 022329 (2006)
We prove an analytical expression for the size of the gap between the ground and the first excited state of quantum adiabatic algorithm for the 3-satisfiability, where the initial Hamiltonian is a projector on the subspace complementary to the ground
Externí odkaz:
http://arxiv.org/abs/quant-ph/0509162
Publikováno v:
Proceedings of the Genetic and Evolutionary Computation Conference Companion.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9e3d5dbef3b5cd267dad305e3047418
https://doi.org/10.1145/3520304.3529005
https://doi.org/10.1145/3520304.3529005
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Information and Computation
Information and Computation, 2018, 248, pp.55-77
Lecture Notes in Computer Science
8th IFIP International Conference on Theoretical Computer Science (TCS)
8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.151-163, ⟨10.1007/978-3-662-44602-7_13⟩
Information and Computation, Elsevier, 2018, 248, pp.55-77
Advanced Information Systems Engineering ISBN: 9783642387081
IFIP TCS
Information and Computation, 2018, 248, pp.55-77
Lecture Notes in Computer Science
8th IFIP International Conference on Theoretical Computer Science (TCS)
8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.151-163, ⟨10.1007/978-3-662-44602-7_13⟩
Information and Computation, Elsevier, 2018, 248, pp.55-77
Advanced Information Systems Engineering ISBN: 9783642387081
IFIP TCS
Part 2: Track B: Logic, Semantics, Specification and Verification; International audience; In this paper an implicit characterization of the complexity classes k-EXP and k-FEXP, for k ≥ 0, is given, by a type assignment system for a stratified λ-c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::954c20417777d2caea1e00a09f25ff8a
https://hal.science/hal-01948275
https://hal.science/hal-01948275