Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Systems Theory, Volume 25
Volume 25, Number 1, 1992
- Ulrich Huckenbeck:
Constructing Sets of Functions Which Have a Given F-Cardinality. 3-22 - David Eppstein, Lane A. Hemachandra
, James Tisdall, Bülent Yener:
Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes. 23-36 - Christiane Frougny:
Representations of Numbers and Finite Automata. 37-60 - Jean-Michel Autebert, Luc Boasson:
The Equivalence of pre-NTS Grammars is Decidable. 61-74
Volume 25, Number 2, 1992
- Peter Clote:
A Time-Space Hierarchy Between Polynomial Time and Polynomial Space. 77-92 - Ravi Janardan, Siu-Wing Cheng:
Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. 93-122 - Evangelos Kranakis, Paul M. B. Vitányi:
A Note on Weighted Distributed Match-Making. 123-140 - Sandy Irani, Moni Naor, Ronitt Rubinfeld:
On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil? 141-159
Volume 25, Number 3, 1992
- Raymond Greenlaw:
The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem. 161-175 - Tomoyuki Yamakami:
Structural Properties for Feasibly Computable Classes of Type Two. 177-201 - Alan L. Selman:
A Survey of One-Way Functions in Complexity Theory. 203-221 - Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel:
Structure and Importance of Logspace-MOD Class. 223-237
Volume 25, Number 4, 1992
- Friedrich Otto:
The Problem of Deciding Confluence on a Given Congruence Class is Tractable for Finite Special String-Rewriting Systems. 241-251 - Andrew Gleason:
Semigroups of Shift Register Counting Matrices. 253-267 - Ruey-Der Lou, Majid Sarrafzadeh, Chong S. Rim, Kazuo Nakajima, Sumio Masuda:
General Circular Permutation Layout. 269-292 - Michael C. Loui, David R. Luginbuhl:
The Complexity of On-Line Simulations Between Multidimensional Turing Machines and Random Access Machines. 293-308 - Siegfried Lehr:
A Result About Languages Concerning Paperfolding Sequences. 309-313
a service of 
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.
last updated on 2024-04-25 04:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
