(Q52066137)

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

6 November 2019

title

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

1 reference

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

6 November 2019

main subject

computational complexity

1 reference

1

1 reference

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

6 November 2019

author name string

Monasson R

series ordinal

2

1 reference

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

6 November 2019

language of work or name

English

0 references

publication date

1 February 2001

1 reference

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

6 November 2019

published in

Physical Review Letters

1 reference

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

6 November 2019

volume

86

1 reference

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

6 November 2019

issue

8

1 reference

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

6 November 2019

page(s)

1654-1657

1 reference

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

A Computing Procedure for Quantification Theory

6 November 2019

cites work

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1654

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%2FPHYSREVLETT.86.1654

Analysis of Two Simple Heuristics on a Random Instance ofk-sat

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1654

Determining computational complexity from characteristic ‘phase transitions’

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1654

Many hard examples for resolution

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1654

10.1103/PHYSREVLETT.86.1654

21 January 2018

Identifiers

DOI

1 reference

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

6 November 2019

1 reference

1 reference