You have Guest access.
Log In
Volume 1 / 1967 - Volume 50 / 2012
From Volume 1 (1967) to Volume 29 (1996), this journal was published as Mathematical Systems Theory.
551-572
Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group
Z. Miller, D. Pritikin and I. H. Sudborough
573-587
The bounded membership problem of the monoid SL 2( N )
J. Cai and Z. Liu
589-598
Node bisectors of Cayley graphs
S. R. Blackburn
599-634
Set-driven and rearrangement-independent learning of recursive languages
S. Lange and T. Zeugmann
635-647
On digital nondeterminism
F. Cucker and M. Matamala
649-659
Lower bounds for the majority communication complexity of various graph accessibility problems
C. Meinel and S. Waack
661-671
Alternating time versus deterministic time: A separation
S. Gupta
Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group
Z. Miller, D. Pritikin and I.H. Sudborough
The Bounded Membership Problem of the Monoid SL_2(N)
Node Bisectors of Cayley Graphs
S.R. Blackburn
Set-Driven and Rearrangement-Independent Learning of Recursive Languages
On Digital Nondeterminism
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems
661-672
Alternating Time Versus Deterministic Time: A Separation
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info