Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms (Q58001590)

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:16241301%20AND%20SRC:MED&resulttype=core&format=json

8 January 2020

title

Solving satisfiability problems by fluctuations: the dynamics of stochastic local search algorithms (English)

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:16241301%20AND%20SRC:MED&resulttype=core&format=json

8 January 2020

0 references

3

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:16241301%20AND%20SRC:MED&resulttype=core&format=json

8 January 2020

author name string

Wolfgang Barthel

series ordinal

1

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:16241301%20AND%20SRC:MED&resulttype=core&format=json

8 January 2020

Alexander K Hartmann

series ordinal

2

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:16241301%20AND%20SRC:MED&resulttype=core&format=json

8 January 2020

language of work or name

English

0 references

publication date

12 June 2003

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:16241301%20AND%20SRC:MED&resulttype=core&format=json

8 January 2020

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:16241301%20AND%20SRC:MED&resulttype=core&format=json

8 January 2020

volume

67

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:16241301%20AND%20SRC:MED&resulttype=core&format=json

8 January 2020

issue

6 Pt 2

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:16241301%20AND%20SRC:MED&resulttype=core&format=json

8 January 2020

page(s)

066104

1 reference

https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:16241301%20AND%20SRC:MED&resulttype=core&format=json

Weight space structure and internal representations: A direct approach to learning and generalization in multilayer neural networks.

8 January 2020

cites work

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

A variational description of the ground state structure in random satisfiability problems

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Analytic and algorithmic solution of random satisfiability problems.

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Random K-satisfiability problem: from an analytic solution to an efficient algorithm.

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Phase Transition in the Number Partitioning Problem

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Number of Guards Needed by a Museum: A Phase Transition in Vertex Covering of Random Graphs

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Minimal vertex covers on finite-connectivity random graphs: A hard-sphere lattice-gas picture

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

21 January 2018

Coloring random graphs.

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Dynamics of heuristic optimization algorithms on random graphs

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Trajectories in phase diagrams, growth processes, and computational complexity: how search algorithms solve the 3-satisfiability problem.

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs.

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions.

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Critical behavior in the satisfiability of random boolean expressions.

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Simplest randomK-satisfiability problem

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

A ferromagnet with a glass transition

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Determining computational complexity from characteristic ‘phase transitions’

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Random costs in combinatorial optimization

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Optimizing searches via rare events

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

Relaxation and metastability in a local search procedure for the random satisfiability problem

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVE.67.066104