Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms. (Q1853479): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4263670 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4875219 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4224900 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the power of DNA-computing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4529984 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4737643 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00095-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969885872 / rank | |||
Normal rank | |||
Latest revision as of 10:00, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms. |
scientific article |
Statements
Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms. (English)
0 references
21 January 2003
0 references
