A lower bound for perceptrons and an Oracle separation of the PPPH hierarchy

Authors:
Christer Berg;Staffan Ulfberg
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1998

Citing 0
Cited 3

Learning DNF in time 2õ(n1/3)

Journal of Computer and System Sciences - STOC 2001
On the computational power of Boolean decision lists

Computational Complexity
Hierarchical unambiguity

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract