On the complexity of probabilistic trials for hidden satisfiability problems (Q4608570)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of probabilistic trials for hidden satisfiability problems |
scientific article; zbMATH DE number 6851845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of probabilistic trials for hidden satisfiability problems |
scientific article; zbMATH DE number 6851845 |
Statements
21 March 2018
0 references
computational complexity
0 references
satisfiability problems
0 references
trial and error
0 references
quantum computing
0 references
learning theory
0 references
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems (English)
0 references
0.7667610049247742
0 references
0.7537153959274292
0 references
0.7492944002151489
0 references
0.748296320438385
0 references
