Cantitate/Preț
Produs
Total produse
Vezi coșul
Foundations of Software Technology and Theoretical Computer Science de Somenath Biswas

Foundations of Software Technology and Theoretical Computer Science

Editat de Somenath Biswas, Kesav V. Nori
en Limba Engleză Paperback – 27 noi 1991
This volume contains the proceedings of the EleventhConference on Foundations of Software Technology andTheoretical Computer Science held in New Dehli, IndiaDecember 17-19, 1991. Three invited papers and 25contributed papers selected from 78 submissions by authorsfrom many different countries reflect the current researchconcerns of the theoreticalcomputer science community. Thetopics covered include:-Algorithms (sequential, parallel and geometric)-Automata theory-Functional programming-Learning-Logic of programs-Semantics-Structural complexity theory-Type theory.
Citește tot Restrânge

Preț: 32914 lei

Preț vechi: 41142 lei
-20%

Puncte Express: 494

Carte tipărită la comandă

Livrare economică 21 iulie-04 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540549673
ISBN-10: 3540549676
Pagini: 436
Ilustrații: XI, 425 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Program checking.- Randomizing reductions of search problems.- Time analysis, cost equivalence and program refinement.- AC-equation solving.- On the operational interpretation of complex types.- Tense logics for local reasoning in distributed systems.- Failures semantics for a simple process language with refinement.- Correctness of programs over poor signatures.- Complexity issues for vacillatory function identification.- A purely algebraic proof of McNaughton's theorem on infinite words.- The structure and complexity of minimal NFA's over a unary alphabet.- Relativised cellular automata and complexity classes.- Computing the order of a locally testable automaton.- On the structure and complexity of infinite sets with minimal perfect hash functions.- NP-hard sets and creativeness over constant time languages.- Complete problems involving boolean labelled structures and projection translations.- Is BP.? $$\mathcal{P}$$ a probabilistic class?.- Fast stable in-place sorting with O(n) data moves.- A theorem on the approximation of set cover and vertex cover.- A fast algorithm for the principal partition of a graph.- Uniform circuits and exclusive read PRAMs.- Contracting planar graphs efficiently in parallel.- Fast deterministic selection on mesh-connected processor arrays.- Improved selection in totally monotone arrays.- Designing secure communication protocols from trust specifications.- Computing the shortest path tree in a weak visibility polygon.- Usefulness of angle-sweep over line-sweep.- Petri nets and transition systems (Abstract for an invited talk).