Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 423598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three \(\sum^ P_ 2\)-complete problems in computational learning theory |
scientific article; zbMATH DE number 423598 |
Statements
Three \(\sum^ P_ 2\)-complete problems in computational learning theory (English)
0 references
10 October 1993
0 references
computational learning theory
0 references
\(\Sigma_ 2^ P\)-completeness
0 references
pattern languages
0 references
graph reconstruction
0 references
0.8073963522911072
0 references
0.7954720854759216
0 references
0.7738887071609497
0 references
