Results 1 to 10 of about 740,535 (191)

Computational Complexity in Electronic Structure [PDF]

, 2012
In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations.
Aaronson, Aharonov, Alán Aspuru-Guzik, Arora, Arora, Arora, Aspuru-Guzik, Aspuru-Guzik, Auerbach, Barahona, Batista, Ben-David, Bernstein, Berry, Biamonte, Biamonte, Bogdanov, Boyd, Bravyi, Brown, Brown, Chan, Chan, Chan, Cleveland, Coulson, Cramer, Deutsch, Dutta, Feynman, Foulkes, Grötschel, Hammond, Harrow, Helgaker, Hohenberg, Hong, Istrail, James Daniel Whitfield, Jordan, Kassal, Kassal, Kempe, Kitaev, Kitaev, Koch, Kohn, Lester Jr., Levine, Lieb, Liu, Lloyd, Love, Lu, Mazziotti, Mazziotti, Moore, Nielsen, Oliveira, Onsager, Ortiz, Osborne, Parr, Peter John Love, Rassolov, Schuch, Schuch, Schuch, Sipser, Somma, Szabo, Tempel, Troyer, Turing, Veis, Verstraete, Verstraete, Wei, Whitfield, Wu, Yung   +80 more
core   +3 more sources

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges [PDF]

, 2014
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Bredereck, Robert, Chen, Jiehua, Faliszewski, Piotr, Guo, Jiong, Niedermeier, Rolf, Woeginger, Gerhard J.   +5 more
core   +3 more sources

On the practically interesting instances of MAXCUT [PDF]

, 2012
The complexity of a computational problem is traditionally quantified based on the hardness of its worst case. This approach has many advantages and has led to a deep and beautiful theory.
Bilu, Yonatan, Daniely, Amit, Linial, Nati, Saks, Michael   +3 more
core   +6 more sources

On the Complexity of Lattice Puzzles [PDF]

, 2019
In this paper, we investigate the computational complexity of lattice puzzle, which is one of the traditional puzzles. A lattice puzzle consists of 2n plates with some slits, and the goal of this puzzle is to assemble them to form a lattice of size n x n.
Kobayashi, Yasuaki, Suetsugu, Koki, Tsuiki, Hideki, Uehara, Ryuhei   +3 more
core   +1 more source

Credimus

, 2019
We believe that economic design and computational complexity---while already important to each other---should become even more important to each other with each passing year. But for that to happen, experts in on the one hand such areas as social choice,
A Appel, A Shamir, C Lund, D Barrington, J Hartmanis, J Hartmanis, J Hartmanis, J Lutz, J Storer, J-Y Cai, L Fortnow, L Hemaspaandra, L Hemaspaandra, Michael Sipser, Moshe Y. Vardi, N Immerman, N Nisan, R Szelepcsényi, S Arora, S Kurtz, S Toda, W Gasarch   +21 more
core   +1 more source

On Iterated Dominance, Matrix Elimination, and Matched Paths [PDF]

, 2010
We study computational problems arising from the iterated removal of weakly dominated actions in anonymous games. Our main result shows that it is NP-complete to decide whether an anonymous game with three actions can be solved via iterated weak ...
Brandt, Felix, Fischer, Felix, Holzer, Markus   +2 more
core   +5 more sources

An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation

, 2003
This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target keyword in an
A. Ambainis, C.H. Bennett, H. Buhrman, H. Nishimura, J. Feigenbaum, L.M. Adleman, P. Høyer, R. Beals, R. Beigel, T. Yamakami   +9 more
core   +3 more sources

The newfound relationship between extrachromosomal DNAs and excised signal circles

FEBS Letters, EarlyView.
Extrachromosomal DNAs (ecDNAs) contribute to the progression of many human cancers. In addition, circular DNA by‐products of V(D)J recombination, excised signal circles (ESCs), have roles in cancer progression but have largely been overlooked. In this Review, we explore the roles of ecDNAs and ESCs in cancer development, and highlight why these ...
Dylan Casey, Zeqian Gao, Joan Boyes
wiley   +1 more source

Quantum Hamiltonian Complexity

, 2015
Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint ...
Gharibian, Sevag, Huang, Yichen, Landau, Zeph, Shin, Seung Woo   +3 more
core   +1 more source

Cell wall target fragment discovery using a low‐cost, minimal fragment library

FEBS Letters, EarlyView.
LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan, Mathew Stanley, Olawale Raimi, Andrew T. Ferenbach, Helge C Dorfmueller, Daan M. F. van Aalten   +5 more
wiley   +1 more source