Critical behavior in the computational cost of satisfiability testing (Q2674189): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127673837, #quickstatements; #temporary_batch_1722635374576
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0004-3702(95)00056-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084033406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardest constraint problems: A double phase transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The birth of the giant component / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Behavior in the Satisfiability of Random Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3481743 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127673837 / rank
 
Normal rank

Latest revision as of 22:50, 2 August 2024

scientific article
Language Label Description Also known as
English
Critical behavior in the computational cost of satisfiability testing
scientific article

    Statements

    Critical behavior in the computational cost of satisfiability testing (English)
    0 references
    0 references
    0 references
    22 September 2022
    0 references
    dynamical critical phenomena
    0 references
    phase transition
    0 references
    finite-size scaling
    0 references
    satisfiability
    0 references
    \(k\)-satisfiability
    0 references
    computational cost scaling
    0 references
    complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references