Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

11

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540133728, 9783540389293

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A lower bound on complexity of branching programs

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030331 ◽

1984 ◽

pp. 480-489 ◽

Author(s):

P. Pudlák

Keyword(s):

Lower Bound ◽

Branching Programs

Download Full-text

Process logics : two decidability results

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030309 ◽

1984 ◽

pp. 282-290 ◽

Author(s):

Z. Habasiński

Download Full-text

An exponential lower bound for one-time-only branching programs

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030340 ◽

1984 ◽

pp. 562-566 ◽

Author(s):

Stanislav Žák

Keyword(s):

Lower Bound ◽

Branching Programs ◽

Exponential Lower Bound

Download Full-text

The equivalence problem and correctness formulas for a simple class of programs

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030314 ◽

1984 ◽

pp. 330-338 ◽

Author(s):

Oscar H. Ibarra ◽

Louis E. Rosier

Keyword(s):

Equivalence Problem ◽

Download Full-text

On searching of special classes of mazes and finite embedded graphs

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030310 ◽

1984 ◽

pp. 291-300 ◽

Author(s):

A. Hemmerling ◽

K. Kriegel

Keyword(s):

Embedded Graphs ◽

Special Classes

Download Full-text

The structure of polynomial complexity cores

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030328 ◽

1984 ◽

pp. 452-458 ◽

Author(s):

Pekka Orponen ◽

Uwe Schöning

Keyword(s):

Polynomial Complexity

Download Full-text

Monotone edge sequences in line arrangements and applications

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030307 ◽

1984 ◽

pp. 265-272

Author(s):

Herbert Edelsbrunner ◽

Emmerich Welzl

Keyword(s):

Line Arrangements

Download Full-text

Representations of integers and language theory

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030323 ◽

1984 ◽

pp. 407-415 ◽

Author(s):

Aldo de Luca ◽

Antonio Restivo

Keyword(s):

Language Theory ◽

Representations Of Integers

Download Full-text

Gödel numberings, principal morphisms, combinatory algebras

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030322 ◽

1984 ◽

pp. 397-406 ◽

Author(s):

G. Longo ◽

E. Moggi

Download Full-text

Models and operators for nondeterministic processes

Mathematical Foundations of Computer Science 1984 - Lecture Notes in Computer Science ◽

10.1007/bfb0030326 ◽

1984 ◽

pp. 433-442 ◽

Author(s):

Rocco De Nicola

Download Full-text