Backtracking with multi-level dynamic search rearrangement (Q1138385): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Estimating the Efficiency of Backtrack Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics and Computer Science: Coping with Finiteness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3233529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5736488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Size by Partial Backtracking / 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 complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Average Time Analysis of Backtracking / rank
 
Normal rank

Revision as of 03:42, 13 June 2024

scientific article
Language Label Description Also known as
English
Backtracking with multi-level dynamic search rearrangement
scientific article

    Statements

    Backtracking with multi-level dynamic search rearrangement (English)
    0 references
    0 references
    0 references
    1981
    0 references
    backtracking
    0 references
    multi-level dynamic search
    0 references
    search order
    0 references
    backtrack tree
    0 references
    search rearrangement algorithm
    0 references

    Identifiers