S. Mertens  Home/Search
Context
Related
| itp.nat.unimagdeburg.d...complex.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: itp.nat.unimagdeburg.de/~mert... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics. 1 Introduction 1.1 Motivation Compared to the traditionally close relationship between physics and mathematics, an exchange of ideas and methods between physics and computer science barely takes places. The few interactions that go beyond Fortran programming and the quest for faster computers were often successful and provided surprising... (Update)
Active bibliography (related documents): More All
0.5: Critical Behavior In The Satisfiability Of Random K-Horn Formulae - Istrate (Correct)
0.5: Forma Analysis and new Heuristic Ideas for the Number.. - Berretta, Cotta, Moscato (2001) (Correct)
0.5: Postman Problems on Mixed Graphs - Mart (2003) (Correct)
Similar documents based on text: More All
0.0: Disproof of the Mertens Conjecture - Odlyzko, Riele (1985) (Correct)
0.0: On the remainder in a series of Mertens - Lindqvist, Peetre (Correct)
0.0: Barely Random Algorithms for Multiprocessor Scheduling - Seiden (2001) (Correct)
BibTeX entry: (Update)
@misc{ mertens-computational,
author = "S. Mertens",
title = "Computational Complexity for Physicists",
url = "citeseer.ist.psu.edu/mertens00computational.html" }
Citations (may not include all citations):534 The complexity of theorem proving procedures (context) - Cook - 1971
308 Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1990 ACM DBLP
251 The complexity of computing the permanent (context) - Valiant - 1979 DBLP
191 Algorithms for Constraint Satisfaction Problems: A Survey - Kumar - 1992
164 Polynomial-time algorithms for prime factorization and discr.. - Shor - 1997 ACM DBLP
160 Exactly Solved Models in Statistical Mechanics (context) - Baxter - 1982
150 Computational Complexity (context) - Papadimitriou - 1994 ACM
123 A linear-time algorithm for testing the truth of certain qua.. (context) - Aspvall, Plass et al. - 1979 DBLP
116 Simulating physics with computers - Feynman - 1982
104 Combinatorial Optimization (context) - Papadimitriou, Steiglitz - 1982
96 A Guide to the Theory of NP-Completeness (context) - Garey, Johnson et al. - 1997
94 the structure of polynomial time reducibility (context) - Ladner - 1975
92 A compendium of NP optimization problems - Crescenzi, Kann
84 The Emperor's new Mind (context) - Penrose - 1989
81 Critical behavior in the satisfiability of random boolean ex.. - Kirkpatrick, Selman - 1994
61 Polynomial-time approximation algorithms for the Ising model - Jerrum, Sinclair - 1990
50 The MIT Electrical Engineering and Computer Science Series (context) - Cormen, Leiserson et al. - 1990
45 Efficient algorithms for finding minimum spanning trees in u.. (context) - Gabow, Galil et al. - 1986 ACM DBLP
41 the computational complexity of Ising spin glass models (context) - Barahona - 1982
41 Spin glass theory and beyond (context) - Mezard, Parisi et al. - 1987
34 Every prime has a succinct certificate (context) - Pratt - 1975 DBLP
33 the computational complexity of the Jones and Tutte polynomi.. (context) - Jaeger, Vertigan et al. - 1990
32 phase transitions (context) - Monasson, Zecchina et al. - 1999
25 Application of statistical mechanics to NP-complete problems.. (context) - Fu, Anderson - 1986
17 A two-dimensional model with an order-disorder transition (context) - Onsager - 1944
16 Computational Solutions for TSP Applications (context) - Reinelt, Salesman - 1994
14 Computational complexity (context) - Johnson, Papadimitriou ACM
14 Can't get no satisfaction (context) - Hayes - 1997
13 The computational complexity of some classical problems from.. - Welsh - 1990
9 limit in the random assignment problem (context) - Aldous - 2000
9 Replicas and optimization (context) - Mezard, Parisi - 1985
8 Statistical mechanics of the random k- satisfiability model (context) - Monasson, Zecchina - 1997
6 volume 184 of Graduate Texts in Mathematics (context) - Bollobas, Theory - 1998
5 Phase transition in the number partitioning problem (context) - Mertens - 1998
5 Wiley-Interscience series in discrete mathematics and optimi.. (context) - Lawler, Lenstra et al. - 1985
5 A conjecture on random bipartite matching (context) - Parisi - 1998
5 three-dimensionality and NP-completeness (context) - Istrail - 2000
5 Mean-field equations for the matching and the travelling sal.. (context) - Mezard, Parisi - 1986
5 The cavity method and the travelling-salesman problem (context) - Krauth, Mezard - 1989
4 Complexity of computer computations (context) - Karp - 1972 DBLP
3 Random costs in combinatorial optimization (context) - Mertens - 2000
2 Solutio problematis ad geometrian situs pertinentis (context) - Euler
1 Lewis and Christos H (context) - Harry - 1978
1 Spektrum der Wissenschaft (context) - Grotschel, Padberg et al. - 1999
1 and William Cook (context) - Applegate, Bixby et al.
1 The number of guards needed by a museum: A phase transition .. (context) - Weigt, Hartmann - 2000
1 Berlin Heidelberg New York (context) - Ausiello, Crescenzi et al. - 1999
1 A physicist's approach to number partitioning (context) - Mertens - 2001 ACM DBLP
1 Introduction to complexity theory (context) - Hartmann - 1999
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC