(Q59066488)

English

Determining computational complexity from characteristic ‘phase transitions’

scientific article published in Nature

In more languages

Statements

scholarly article

0 references

Determining computational complexity from characteristic ‘phase transitions’ (English)

0 references

computational complexity

1 reference

based on heuristic

inferred from title

Riccardo Zecchina

object named as

Riccardo Zecchina

2

0 references

4

object named as

Bart Selman

0 references

author name string

Rémi Monasson

1

0 references

Scott Kirkpatrick

3

0 references

Lidror Troyansky

5

0 references

language of work or name

0 references

publication date

July 1999

0 references

0 references

400

0 references

6740

0 references

133-137

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

https://scigraph.springernature.com/pub.10.1038/22055

0 references

Critical behavior in the satisfiability of random boolean expressions.

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

Generating hard satisfiability problems

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

A linear-time algorithm for testing the truth of certain quantified boolean formulas

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

A Threshold for Unsatisfiability

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

Mick gets some (the odds are on his side) (satisfiability)

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

Entropy of the K-satisfiability problem

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

Tricritical points in random combinatorics: the -SAT case

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

A Computing Procedure for Quantification Theory

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

Scaling concepts for the dynamics of viscous liquids near an ideal glassy state

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

Formation of glasses from liquids and biopolymers

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

Hysteresis and metastability in a continuum sandpile model

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

Generic rigidity percolation: The pebble game

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

Stressed backbone and elasticity of random central-force systems

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

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

1 reference

https://api.crossref.org/works/10.1038%2F22055

7 January 2021

based on heuristic

inferred from DOI database lookup

Identifiers

0 references

Dimensions Publication ID

0 references

zbMATH Open document ID

0 references

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)

Retrieved from "https://www.wikidata.org/w/index.php?title=Q59066488&oldid=2174476207"