A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees (Q1982929): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-38603-0_33 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3000423763 / rank | |||
Normal rank | |||
Latest revision as of 00:12, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees |
scientific article |
Statements
A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees (English)
0 references
14 September 2021
0 references
backtrack search
0 references
parallel tree search
0 references
complexity analysis
0 references
