Výsledky vyhledávání - "Computational complexity theory"

Robust Optimization Autor Ben-Tal, Aharon, El Ghaoui, Laurent, Nemirovski, Arkadi

“… of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject…”
Získat plný text

Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains Autor Liu, Xudong, Truszczynski, Miroslaw

“…We study preference representation models based on partial lexicographic preference trees (PLP-trees). We propose to represent preference relations as forests…”
Získat plný text

A theoretical formalism for analyzing agent-based models Autor North, Michael J

“…Purpose Following Holland, complex adaptive systems (CASs) are collections of interacting, autonomous, learning decision makers embedded in an interactive…”
Získat plný text

Robust optimization Autor Ben-Tal, Aharon

“…Robust optimization is a fairly new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it…”
Získat plný text

Quantum advantage with shallow circuits Autor Bravyi, Sergey, Gosset, David, König, Robert

“… Whether a quantum advantage can be rigorously proven in some setting or demonstrated experimentally using near-term devices is the subject of active debate…”
Zjistit podrobnosti o přístupu

On the computational power of winner-take-all Autor Maass, W

“…-all. Computational models that involve competitive stages have so far been neglected in computational complexity theory, although they are widely used in computational brain models, artificial neural…”
Zjistit podrobnosti o přístupu

Uncomputability and undecidability in economic theory Autor Vela Velupillai, K.

“…] are frontier research subjects. All of them, each in its own way, are underpinned by (classical) recursion theory – and its applied branches, say computational complexity theory or algorithmic information theory…”
Získat plný text

Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda’s Theorem Autor Basu, Saugata, Zell, Thierry

“… . This result, which illustrates the power of counting, is considered to be a seminal result in computational complexity theory…”
Získat plný text

Approximation in two-stage stochastic integer programming Autor Romeijnders, Ward, Stougie, Leen, van der Vlerk, Maarten H.

“…Approximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most…”
Získat plný text

A Journey Through Some Computational Problems Autor Liu, Yin Hugh

“…The research on Holant problems is an important topic in the field of Computational Complexity Theory, which is one of the most important subjects in computer science…”
Získat plný text

The Cook-Reckhow definition Autor Krajicek, Jan

“… to make an explicit and universal link between lengths-of-proofs problems and computational complexity theory…”
Získat plný text

Physical consequences of P\(\neq\)NP and the DMRG-annealing conjecture Autor Rodriguez-Laguna, Javier, Santalla, Silvia N

“…} of physical processes are programs running on Turing machines and, as such, are subject to them. In this work, computational complexity theory is applied to classical simulations of systems performing an adiabatic quantum computation (AQC…”
Získat plný text

On the Emergence of Ergodic Dynamics in Unique Games Autor Sahai, Tuhin, Gnanasekaran, Abeynaya

“…The Unique Games Conjecture (UGC) constitutes a highly dynamic subarea within computational complexity theory, intricately linked to the outstanding P versus NP problem…”
Získat plný text

Quantum Hamiltonian Complexity Autor Gharibian, Sevag, Huang, Yichen, Landau, Zeph, Seung Woo Shin

“…Constraint satisfaction problems are a central pillar of modern computational complexity theory…”
Získat plný text

Computational complexity in entanglement transformations Autor Chitambar, Eric A

“…In physics, systems having three parts are typically much more difficult to analyze than those having just two. Even in classical mechanics, predicting the…”
Získat plný text

complexity theory

“…Computational complexity theory is the branch of computer science/mathematics that deals with the resources required to solve problems…”
Získat plný text

Techniques for analyzing the computational power of constant -depth circuits and space -bounded computation Autor Trifonov, Vladimir Traianov

“…The subject of computational complexity theory is to analyze the difficulty of solving computational problems within different models of computation…”
Získat plný text

Computable Foundations for Economics Autor Velupillai, K. Vela

Získat plný text

Ordering and descriptive complexity Autor Etessami, Kousha

“…The subjects of this thesis are Descriptive and Computational Complexity Theory. Computational complexity asks "How do limitations on computational resources affect computing power…”
Získat plný text