000 | 03876nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-69659-9 | ||
003 | DE-He213 | ||
005 | 20160624102059.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1997 gw | s |||| 0|eng d | ||
020 |
_a9783540696599 _9978-3-540-69659-9 |
||
024 | 7 |
_a10.1007/BFb0058017 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUY _2bicssc |
|
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aCOM031000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aFoundations of Software Technology and Theoretical Computer Science _h[electronic resource] : _b17th Conference Kharagpur, India, December 18–20, 1997 Proceedings / _cedited by S. Ramesh, G Sivakumar. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1997. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1997. |
|
300 |
_aXIII, 351 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1346 |
|
505 | 0 | _aQSM: A general purpose shared-memory model for parallel computation -- Approximating geometric domains through topological triangulations -- Solving some discrepancy problems in NC -- Graph editing to bipartite interval graphs: Exact and asymptotic bounds -- Model checking -- Recursion versus iteration at higher-orders -- Compilation and equivalence of imperative objects -- On the expressive power of rewriting -- Mechanizing verification of arithmetic circuits: SRT division -- On the complexity of parallel implementation of logic programs -- An abductive semantics for disjunctive logic programs and its proof procedure -- Assumption-commitment in automata -- Compositional design of multitolerant repetitive byzantine agreement -- Algorithmic issues in coding theory -- Sharper results on the expressive power of generalized quantifiers -- Improved lowness results for solvable black-box group problems -- On resource-bounded measure and pseudorandomness -- Verification of open systems -- Hoare-Style compositional proof systems for reactive shared variable concurrency -- A simple characterization of stuttering bisimulation -- General refinement for high level petri nets -- Polynomial-Time Many-One reductions for Petri nets -- Computing reachability properties hidden in finite net unfoldings. | |
520 | _aThis book constitutes the refereed proceedings of the 17th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'97. The 18 revised full papers presented were selected from a total of 68 submissions. Also included are five invited papers by Ed Clarke, Deepak Kapur, Madhu Sudan, Vijaya Ramachandran, and Moshe Vardi. Among the topics addressed are concurrency, Petri nets, graph computations, program verification, model checking, recursion theory, rewriting, and error-correcting codes. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aInformation theory. | |
650 | 0 | _aComputational complexity. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
700 | 1 |
_aRamesh, S. _eeditor. |
|
700 | 1 |
_aSivakumar, G. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540638766 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1346 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0058017 |
942 |
_2EBK7310 _cEBK |
||
999 |
_c36604 _d36604 |