|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3230739 |
| 003 |
MWH |
| 005 |
20191028131549.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s1986 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540399094
|
| 024 |
7 |
|
|a 10.1007/BFb0016229
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-3-540-39909-4
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a UM
|2 thema
|
| 245 |
1 |
0 |
|a Mathematical Foundations of Computer Science 1986
|h [electronic resource] :
|b 12th Symposium held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings /
|c edited by Jozef Gruska, Branislav Rovan, Juraj Wiedermann.
|
| 250 |
|
|
|a 1st ed. 1986.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 1986.
|
| 300 |
|
|
|a XI, 650 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 233
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 505 |
0 |
|
|a Why sometimes probabilistic algorithms can be more effective -- Recent results in the theory of rational sets -- Partial interpretations of higher order algebraic types -- Kins of context-free languages -- Algebraic theory of module specifications with constraints -- A semantical model for integration and modularization of rules -- Parallel arithmetic computations: A survey -- An approach to proof checker -- The promise of electronic prototyping -- Systolic arrays: Characterizations and complexity -- Geometric location problems and their complexity -- Developing implicit data structures -- Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs -- Deterministic simulation of idealized parallel computers on more realistic ones -- Relational specifications and observational semantics -- Efficient testing of optimal time adders -- Properties of complexity measures for PRAMs and WARMs -- Iterative systems of equations -- Polynomial complexity of the Newton-Puiseux algorithm -- Unique decipherability for partially commutative alphabet (extended abstract) -- The equivalence of finite valued transducers (on HDTOL languages) is decidable -- A fast parallel algorithm for six-colouring of planar graphs -- Quicksort without a stack -- Towards an efficient merging -- Homomorphic realization of automata with compositions -- Refined bounds on the complexity of sorting and selection in d - dimensional space -- On the inherent combinatorial complexity of geometric problems in d - dimensional space -- The evolution of two stacks in bounded space and random walks in a triangle -- P-genericity and strong p-genericity -- Fibonacci numeration systems and rational functions -- Safe implementation equivalence for asynchronous nondeterministic processes -- Grammars with context dependency restricted to synchronization -- Some improved parallelisms for graphs -- A complete inference system for an algebra of regular acceptance models -- Nondeterministic Turing machines with modified acceptance -- Remark on the power of compass -- Regular chain code picture languages of nonlinear descriptional complexity -- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines -- A new approach to defining the communication complexity for VLSI -- Lower bounds on the complexity of local circuits -- Optimal sorting of seven element sets -- Undecidable problems concerning generalized pascal triangles of commutative algebras -- Regular augmentation of automata and transducers -- On some types of pseudo-random sequences -- The space complexity of the accessibility problem for undirected graphs of log n bounded genus -- An alternative, priority-free, solution to Post's problem -- Near optimal algorithms for finding minimum Steiner trees on random graphs -- Matrix systems and principal cones of algebraic power series -- Two characterizations of the logarithmic alternation hierarchy -- p-Projection reducibility and the complexity classes ? (nonuniform) and N? (nonuniform) -- A proof system to derive eventuality properties under justice hypothesis -- Al-Khowarizmi : A formal system for higher-order logic programming -- One-sided Dyck reduction over two letter alphabet and deterministic context-free languages -- Model and complexity of termination for distributed computations -- Complexity of generalized graph coloring -- The parallel complexity of deadlock detection -- The centers of context-sensitive languages -- A greedy algorithm for constructing shortest common superstrings -- The OI-hierarchy is closed under control -- On the degree of ambiguity of finite automata -- Learning in knowledge based systems, a possibilistic approach -- Proofs that Release Minimum Knowledge.
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 700 |
1 |
|
|a Gruska, Jozef.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Rovan, Branislav.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Wiedermann, Juraj.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 233
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/BFb0016229
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b32307391
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i21439047
|z 02-26-20
|
| 999 |
f |
f |
|i c9c0c8c9-5ae3-5d10-b5e9-eb44747d6f9c
|s ba8cb5d2-beb4-5efd-9fc8-70e7dd18334c
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|