A quantum speedup in machine learning: finding an<i>N</i>-bit Boolean function for a classification (Q3387032): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q60307395, #quickstatements; #temporary_batch_1708039819900 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60307395 / rank | |||
Normal rank | |||
Revision as of 01:41, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A quantum speedup in machine learning: finding an<i>N</i>-bit Boolean function for a classification |
scientific article |
Statements
A quantum speedup in machine learning: finding an<i>N</i>-bit Boolean function for a classification (English)
0 references
12 January 2021
0 references
