A quantum speedup in machine learning: finding an<i>N</i>-bit Boolean function for a classification (Q3387032): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:34, 4 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
