Computational complexity of the landscape. I. (Q877685): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1939025161 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: hep-th/0602072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMES is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of supersymmetric D-brane models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The importance of the P versus NP question / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixing all moduli in a simple F-theory compactification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of the landscape. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical points and supersymmetric vacua, III: String/M models / rank
 
Normal rank
Property / cites work
 
Property / cites work: HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saltatory relaxation of the cosmological constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of topological field theories by quantum computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Computation and Cryptographic Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column / rank
 
Normal rank
Property / cites work
 
Property / cites work: de Sitter vacua in string theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4544834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calabi-Yau four-folds for \(M\)- and \(F\)-theory compactifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: BPP and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncomputability arising in dynamical triangulation model of four- dimensional quantum gravity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in quantum algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental constants and their variation: observational and theoretical status / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cosmological constant problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computers, Rigidity, and Moduli / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical physics and the Church--Turing Thesis / rank
 
Normal rank

Latest revision as of 18:24, 25 June 2024

scientific article
Language Label Description Also known as
English
Computational complexity of the landscape. I.
scientific article

    Statements

    Computational complexity of the landscape. I. (English)
    0 references
    0 references
    0 references
    3 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references