Tibor Hegedüs

According to our database, Tibor Hegedüs authored at least 8 papers between 1993 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1998

Complexity Theoretic Hardness Results for Query Learning.

Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt

Comput. Complex., 1998

1997

On Learning Disjunctions of Zero-One Treshold Functions with Queries.

Tibor Hegedüs, Piotr Indyk

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996

on the Geometric Separability of Boolean Functions.

Tibor Hegedüs, Nimrod Megiddo

Discret. Appl. Math., 1996

1995

Generalized Teaching Dimensions and the Query Complexity of Learning.

Tibor Hegedüs

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994

Combinatorial Results on the Complexity of Teaching and Learning.

Tibor Hegedüs

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Geometrical Concept Learning and Convex Polytopes.

Tibor Hegedüs

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993

On training simple neural networks and small-weight neurons.

Tibor Hegedüs

Proceedings of the First European Conference on Computational Learning Theory, 1993

Can Complexity Theory Benefit from Learning Theory?

Tibor Hegedüs

Proceedings of the Machine Learning: ECML-93, 1993