Structural analysis of polynomial-time query learnability (Q4298371): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+When won't membership queries help?
@@ Property / cites work: When won't membership queries help? / rank @@
+Normal rank
@@ Property / cites work @@
+Q3729902
@@ Property / cites work: Q3729902 / rank @@
+Normal rank
@@ Property / cites work @@
+Cryptographic limitations on learning Boolean formulae and finite automata
+Normal rank
@@ Property / cites work @@
+Prediction-preserving reducibility
@@ Property / cites work: Prediction-preserving reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038688
@@ Property / cites work: Q4038688 / rank @@
+Normal rank
@@ Property / cites work @@
+A framework for polynomial-time query learnability
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01578844
+Normal rank
@@ Property / OpenAlex ID @@
+W1980883546
@@ Property / OpenAlex ID: W1980883546 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4298371