


default search action
Theoretical Computer Science, Volume 137
Volume 137, Number 1, 9 January 1995
- Masami Hagiya:

A Typed lambda-Calculus for Proving-by-Example and Bottom-Up Generalization Procedure. 3-23 - Klaus P. Jantke, Steffen Lange:

Case-Based Representation and Learning of Pattern Languages. 25-51 - Yasuhito Mukouchi, Setsuo Arikawa:

Towards a Mathematical Theory of Machine Discovery from Facts. 53-84 - Sanjay Jain, Arun Sharma

:
On Aggregating Teams of Learning Machines. 85-108 - Akito Sakurai:

On the VC-Dimension of Depth four Threshold Circuits and the Complexity of Boolean-Valued Functions. 109-127 - Ayumi Shinohara

:
Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions. 129-144 - Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro:

epsilon-Approximations of k-Label Spaces. 145-157 - Atsuyoshi Nakamura

, Naoki Abe:
Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries. 159-176
Volume 137, Number 2, 23 January 1995
- Henning Fernau

:
Valuations of Languages, with Applications to Fractal Geometry. 177-217 - Stéphane Fabre:

Substitutions et beta-systèmes de numération. 219-236 - Zoltán Ésik, L. Bernátsky:

Equational Properties of Kleene Algebras of Relations with Conversion. 237-251 - Atsushi Takahashi

, Shuichi Ueno, Yoji Kajitani:
Mixed Searching and Proper-Path-Width. 253-268 - Dany Breslauer:

Fast Parallel String Prefix-Matching. 269-278 - Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler:

If NP has Polynomial-Size Circuits, then MA=AM. 279-282

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














