Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01200064 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964858495 / rank | |||
Normal rank | |||
Latest revision as of 10:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three \(\sum^ P_ 2\)-complete problems in computational learning theory |
scientific article |
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
