Rigorous Estimation of Computational Complexity for OMV SAT Algorithm (Q3519896): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4514535 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New quantum algorithm for studying NP-complete problems / rank | |||
Normal rank | |||
Latest revision as of 13:58, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rigorous Estimation of Computational Complexity for OMV SAT Algorithm |
scientific article |
Statements
Rigorous Estimation of Computational Complexity for OMV SAT Algorithm (English)
0 references
19 August 2008
0 references
