Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 2176
Articles: 1'898'627
Articles rated: 2570

17 September 2019
 
  » search

  Search for articles, messages and online reviews


Search in 1'898'627 articles.


Results 1 to 20 of 511 for query "Computational Complexity cond-mat". (0.00 sec.)

[    1    2    3    4    5    10    ]   Next
1.
Computational Complexity for Physicists
Stephan Mertens;
11 Dec 2000   /  Computing in Science & Engineering vol. 4, no. 3, May/June 2002, pp 31-47
- - -
2.
Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
Matthias Troyer; Uwe-Jens Wiese;
Rating  1/5
16 Aug 2004   /  Phys.Rev.Lett. 94 (2005) 170201
- - -
3.
A Universal Scaling Theory for Complexity of Analog Computation
Yaniv S. Avizrats; Joshua Feinberg; Shmuel Fishman;
5 Aug 2005
- - -
4.
Computational complexity arising from degree correlations in networks
Alexei Vazquez; Martin Weigt;
1 Jul 2002   /  Phys. Rev. E 67, 027101 (2003)
- - -
5.
Analysis of the computational complexity of solving random satisfiability problems using branch and bound search algorithms
Simona Cocco; Remi Monasson;
12 Dec 2000
- - -
6.
The Computational Complexity of Generating Random Fractals
J. Machta; R. Greenlaw;
31 Mar 1995   /  J. Stat. Phys. 82 (1996) 1299
- - -
7.
Chromatic roots are dense in the whole complex plane
Alan D. Sokal;
19 Dec 2000   /  Combin. Probab. Comput. 13, 221-261 (2004)
- - -
8.
Parallel Dynamics and Computational Complexity of Network Growth Models
Benjamin Machta; Jonthan Machta;
16 Aug 2004
- - -
9.
Parallel dynamics and computational complexity of the Bak-Sneppen model
Jon Machta; Xuenan Li;
15 May 2001   /  Physica A300, 245-270 (2001)
- - -
10.
Simplest random K-satisfiability problem
F. Ricci-Tersenghi; M. Weigt; R. Zecchina;
10 Nov 2000   /  Phys. Rev. E 63, 026702 (2001)
- - -
11.
Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs
Martin Weigt; Alexander K. Hartmann;
27 Sep 2000   /  Phys. Rev. Lett. 86, 1658 (2001)
- - -
12.
Ludwig: A parallel Lattice-Boltzmann code for complex fluids
Jean-Christophe Desplat; Ignacio Pagonabarraga; Peter Bladon;
12 May 2000
- - -
13.
Rigorous Born Approximation and beyond for the Spin-Boson Model
D. P. DiVincenzo; D. Loss;
21 May 2004
- - -
14.
Complexity of Two-Dimensional Patterns
Kristian Lindgren; Cristopher Moore; Mats G. Nordahl;
7 Apr 1998
- - -
15.
Internal Diffusion-Limited Aggregation: Parallel Algorithms and Complexity
Cristopher Moore; Jonathan Machta;
15 Sep 1999
- - -
16.
Ianus: an Adpative FPGA Computer
Ianus Collaboration: F. Belletti; I. Campos; A. Cruz; L. A. Fernandez; S. Jimenez; A. Maiorano; F. Mantovani; E. Marinari; V. Martin-Mayor; D. Navarro; A. Munoz-Sudupe; S. Perez Gaviro; G. Poli; J. J. Ruiz-Lorenzo; F. Schifano; D. Sciretti; A. Tarancon; P. Tellez; R. Tripiccione; J. L. Velasco;
12 Jul 2005
- - -
17.
Virtual Time Horizon Control via Communication Network Design
Z. Toroczkai; G. Korniss; M. A. Novotny; H. Guclu;
28 Apr 2003
- - -
18.
The LDA+DMFT Approach to Materials with Strong Electronic Correlations
K. Held; I.A. Nekrasov; G. Keller; V. Eyert; N. Blümer; A.K. McMahan; R.T. Scalettar; T. Pruschke; V.I. Anisimov; D. Vollhardt;
5 Dec 2001   /  "Quantum Simulations of Complex Many-Body Systems: From Theory to Algorithms", J. Grotendorst, D. Marks, and A. Muramatsu (ed.), NIC Series Volume 10, p. 175-209 (2002).
- - -
19.
Generalized Ensemble Simulations for Complex Systems
Bernd A. Berg;
24 Oct 2001   /  Comp. Phys. Commun 104 (2002) 52
- - -
20.
Arbitrage risk induced by transaction costs
E.W.Piotrowski; J. Sladkowski;
Rating  3/5
20 May 2003
- - -
21.
Spatial Order in Liquid Crystals: Computer Simulations of Systems of Ellipsoids
Friederike Schmid; Nguyen H. Phuong;
23 Aug 2002
- - -
22.
Adaptive Mesh Refinement Computation of Solidification Microstructures using Dynamic Data Structures
Nikolas Provatas; Nigel Goldenfeld; Jonathan Dantzig;
20 Aug 1998
- - -
23.
Survey Propagation as local equilibrium equations
A. Braunstein; R. Zecchina;
18 Dec 2003
- - -
24.
Coloring random graphs
R. Mulet; A. Pagnani; M. Weigt; R. Zecchina;
23 Aug 2002   /  Phys. Rev. Lett. 89, 268701 (2002)
- - -
25.
Complexity transitions in global algorithms for sparse linear systems over finite fields
A. Braunstein; M. Leone; F. Ricci-Tersenghi; R. Zecchina;
29 Mar 2002   /  J. Phys. A 35 (2002) 7559
- - -
26.
Complex-Temperature Phase Diagrams for the q-State Potts Model on Self-Dual Families of Graphs and the Nature of the $q o infty$ Limit
Shu-Chiuan Chang; Robert Shrock;
1 Jul 2001   /  Phys. Rev. E 64, 066116 (16 pages) (2001)
- - -
27.
Nonintegrability, Chaos, and Complexity
J. L. McCauley;
13 Dec 1999   /  Physica A237 (1997) 387-404
- - -
28.
The number of guards needed by a museum: A phase transition in vertex covering of random graphs
Martin Weigt; Alexander K. Hartmann;
11 Dec 1999   /  Phys. Rev. Lett. 84, 6118 (2000)
- - -
29.
Multiscale Modeling of Peritectic Reaction Growth
Marcel Ausloos; Rudi Cloots; Nicolas Vandewalle;
29 Apr 2004
- - -
30.
Exact solutions for diluted spin glasses and optimization problems
S. Franz; M. Leone; F. Ricci-Tersenghi; R. Zecchina;
15 Mar 2001   /  Phys. Rev. Lett. 87 (2001) 127209
- - -

[ 1 2 3 4 5 10 ]   Next





ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2019 - Scimetrica