Fetching the paper…
Reading the bibliography…
Optimization problems associated with the interaction of linked particles are at the heart of polymer science, protein folding and other important problems in the physical sciences.
S. A. Cook, “The complexity of theorem-proving procedures,” Proceedings of the third annual ACM symposium on Theory of computing STOC 71
1971
Earlier work this paper cites.
S. Even, A. Itai, and A. Shamir, “On the Complexity of Timetable and Multicommodity Flow Problems,” SIAM Journal on Computing
1976
Earlier work this paper cites.
V. Chvatal, “A Greedy Heuristic for the Set-Covering Problem,” Mathematics of Operations Research
1979
Earlier work this paper cites.
A. Apolloni, N. Cesa-Bianchi, and D. De Falco, “A numerical implementation of quantum annealing,” Stochastic Processes, Physics and Geometry, Proceedings of the Ascona-Locarno Conference
1988
Earlier work this paper cites.
K. F. Lau and K. A. Dill, “A lattice statistical mechanics model of the conformational and sequence spaces of proteins,” Macromolecules
1989
Earlier work this paper cites.
B. Apolloni, C. Carvalho, and D. De Falco, “Quantum stochastic optimization,” Stoc. Proc. Appl
1989
Earlier work this paper cites.
P. Hansen and B. Jaumard, “Approximation Algorithms for the Maximum Satisfiability Problem,” Computing
1990
Earlier work this paper cites.
K. A. Dill, “Folding Proteins - Finding A Needle in A Haystack,” Current Opinion in Structural Biology
1993
Earlier work this paper cites.
A. Sali, E. Shakhnovich, and M. Karplus, “How does a protein fold?,” Nature
1994
Earlier work this paper cites.
E. I. Shakhnovich, “Proteins with selected sequences fold into unique native conformation,” Physical Review Letters
1994
Earlier work this paper cites.
A. B. Finnila, M. A. Gomez, C. Sebenik, C. Stenson, and J. D. Doll, “Quantum Annealing: A New Method for Minimizing Multidimensional Functions,” Chemical Physics Letters
1994
Earlier work this paper cites.
K. A. Dill, “Simple lattice models of protein folding,” Polymer Preprints American Chemical Society Division of Polymer Chemistry
1995
Earlier work this paper cites.
K. Yue and K. A. Dill, “Forces of tertiary structural organization in globular proteins.,” Proceedings of the National Academy of Sciences of the United States of America
1995
Earlier work this paper cites.
C. J. Camacho, “Entropic Barriers, Frustration and Order: Basic Ingredients in Protein Folding,” Physical Review Letters
1995
Earlier work this paper cites.
S. Miyazawa and R. L. Jernigan, “Residue-residue potentials with a favorable contact pair term and an unfavorable high packing density term, for simulation and threading.,” Journal of Molecular Biology
1996
Earlier work this paper cites.
E. I. Shakhnovich, “Modeling protein folding: the beauty and power of simplicity.,” Folding design
1996
Earlier work this paper cites.
W. E. Hart and S. Istrail, “Robust proofs of NP-hardness for protein folding: general lattices and energy potentials.,” Journal of computational biology a journal of computational molecular cell biology
1997
Earlier work this paper cites.
M. Gruebele and P. G. Wolynes, “Satisfying turns in folding transitions.,” 1998
1998
Earlier work this paper cites.
B. Berger and T. Leighton, “Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete.,” Journal of computational biology a journal of computational molecular cell biology
1998
Earlier work this paper cites.
P. Crescenzi, D. Goldman, C. Papadimitriou, A. Piccolboni, and M. Yannakakis, “On the complexity of protein folding.,” Journal of computational biology a journal of computational molecular cell biology
1998
Earlier work this paper cites.
P. Hansen, B. Jaumard, and M. P. De Aragao, “Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem,” Eur J Operational Research
1998
Earlier work this paper cites.
R. Backofen, “Using Constraint Programming for lattice Protein Folding,” Energy
1998
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, “Quantum Annealing in the Transverse Ising Model,” Physical Review E
1998
Earlier work this paper cites.
H. Nymeyer, A. E. García, and J. N. Onuchic, “Folding funnels and frustration in off-lattice minimalist protein landscapes.,” Proceedings of the National Academy of Sciences of the United States of America
1998
Cited alongside, same era.
L. Krippahl and P. Barahona, “Applying Constraint Programming to Protein Structure Determination,” Principles and Practice of Constraint Programming CP99
1999
Cited alongside, same era.
V. Pande, A. Grosberg, and T. Tanaka, “Heteropolymer freezing and design: Towards physical models of protein folding,” Reviews of Modern Physics
2000
Cited alongside, same era.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, “Quantum Computation by Adiabatic Evolution,” Science
2000
Cited alongside, same era.
D. Baker, “A surprising simplicity to protein folding.,” Nature
2000
Cited alongside, same era.
J. D. Biamonte, “Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins,” Physical Review A
2008
Later among the works it cites.
S. Laue, “Geometric Set Cover and Hitting Sets for Polytopes in Rˆ3,” Science
2008
Later among the works it cites.
2008
Later among the works it cites.
M. Soos, K. Nohl, and C. Castelluccia, “Extending SAT Solvers to Cryptographic Problems,” SAT
2009
Later among the works it cites.
R. Hemmecke, M. Köppe, J. Lee, and R. Weismantel, “Nonlinear Integer Programming,” 50 Years of Integer Programming 19582008
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J.-E. Shea, J. N. Onuchic, and C. L. Brooks, “Energetic frustration and the nature of the transition state in protein folding,” Journal of Chemical Physics
2000
Cited alongside, same era.
L. Mirny and E. Shakhnovich, “Protein folding theory: from lattice to all-atom models.,” Annual Review of Biophysics and Biomolecular Structure
2001
Cited alongside, same era.
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, “A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem,” Science
2001
Cited alongside, same era.
E. Boros and P. L. Hammer, “Pseudo-boolean optimization,” Discrete Applied Mathematics
2002
Cited alongside, same era.
F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallah, “Generic ILP versus specialized 0-1 ILP: an update,” 2002
2002
Cited alongside, same era.
A. Dal Palù, A. Dovier, and F. Fogolari, “Constraint Logic Programming approach to protein structure prediction,” BMC Bioinformatics
2004
Cited alongside, same era.
D. Boughaci and H. Drias, “Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic,” Proceedings of the 2004 ACM symposium on Applied computing SAC 04
2004
Cited alongside, same era.
A. Choi, T. Standley, and A. Darwiche, “Approximating Weighted Max-SAT Problems by Compensating for Relaxations,” CP
2009
Later among the works it cites.
IBM, “IBM ILOG CPLEX V12.1: User’s Manual for CPLEX,” 2009
2009
Later among the works it cites.
V. S. Pande, “Simple theory of protein folding kinetics.,” Physical Review Letters
2010
Later among the works it cites.
A. D. Ullah and K. Steinhöfel, “A hybrid approach to protein folding problem integrating constraint programming with local search.,” BMC Bioinformatics
2010
Later among the works it cites.
D. Pankratov and A. Borodin, “On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem,” in Theory and Applications of Satisfiability Testing SAT 2010
2010
Later among the works it cites.
L. S. L. Shi and X. C. X. Cai, “An Exact Fast Algorithm for Minimum Hitting Set,” 2010
2010
Later among the works it cites.
2010
Later among the works it cites.
R. D. Schram, G. T. Barkema, and R. H. Bisseling, “Exact enumeration of self-avoiding walks,” Journal of Statistical Mechanics: Theory and Experiment
2011
Later among the works it cites.
M. T. Oakley, D. J. Wales, and R. L. Johnston, “Energy Landscape and Global Optimization for a Frustrated Model Protein,” The Journal of Physical Chemistry B
2011
Later among the works it cites.
P. Manolios and V. Papavasileiou, “Pseudo-Boolean Solving by incremental translation to SAT,” 2011
2011
Later among the works it cites.
F. Kahl and P. Strandmark, “Generalized roof duality for pseudo-boolean optimization,” 2011
2011
Later among the works it cites.
K. Chandrasekaran, R. Karp, E. Moreno-Centeno, and S. Vempala, “Algorithms for Implicit Hitting Set Problems,” SODA
2011
Later among the works it cites.
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, S. Uchaikin, J. Wang, B. Wilson, and G. Rose, “Quantum annealing with manufactured spins,” Nature
2011
Later among the works it cites.
V. N. Smelyanskiy, E. G. Rieffel, S. I. Knysh, C. P. Williams, M. W. Johnson, M. C. Thom, W. G. Macready, and K. L. Pudenz, “A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration,” Electrical Engineering
2012
Closest in time.
A. Perdomo-Ortiz, N. Dickson, M. Drew-Brook, G. Rose, and A. Aspuru-Guzik, “Finding low-energy conformations of lattice protein models by quantum annealing,” Scientific Reports
2012
Closest in time.
V. S. Denchev, N. Ding, S. V. N. Vishwanathan, and H. Neven, “Robust Classification with Adiabatic Quantum Optimization,” Proc Int Conf on Machine Learning
2012
Closest in time.
R. Babbush, B. O’Gorman, and A. Aspuru-Guzik, “Resource Efficient Gadgets for Compiling Adiabatic Quantum Optimization Problems,” submitted
2013
Closest in time.