---

＜電子ブック＞
Algorithms and Complexity : Second Italian Conference, CIAC '94, Rome, Italy, February 23 - 25, 1994. Proceedings / edited by Maurizio Bonuccelli, Pierluigi Crescenzi, Rossella Petreschi
(Lecture Notes in Computer Science. ISSN:16113349 ; 778)

版	1st ed. 1994.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1994
本文言語	英語
大きさ	IX, 227 p : online resource
著者標目	Bonuccelli, Maurizio editor Crescenzi, Pierluigi editor Petreschi, Rossella editor SpringerLink (Online service)
件　名	LCSH:Computer science LCSH:Data structures (Computer science) LCSH:Information theory LCSH:Algorithms LCSH:Artificial intelligence -- Data processing  全ての件名で検索 LCSH:Discrete mathematics FREE:Theory of Computation FREE:Data Structures and Information Theory FREE:Algorithms FREE:Data Science FREE:Discrete Mathematics
一般注記	On the intellectual terrain around NP -- Advances in graph drawing -- On a parallel-algorithms method for string matching problems (overview) -- Some open problems in approximation -- New local search approximation techniques for maximum generalized satisfiability problems -- Learning behaviors of automata from multiplicity and equivalence queries -- Measures of Boolean function complexity based on Harmonic Analysis -- Graph theory and interactive protocols for Reachability Problems on finite Cellular automata -- Parallel pruning decomposition (PDS) and biconnected components of graphs -- A non-interactive electronic cash system -- A unified scheme for routing in expander based networks -- Dynamization of backtrack-free search for the constraint satisfaction problem -- Efficient reorganization of binary search trees -- Time-message trade-offs for the weak unison problem -- On set equality-testing -- On the complexity of some reachability problems -- On self-reducible sets of low information content -- Lower bounds for merging on the hypercube The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Rome. This biannual conference series is intended to present research contributions in theory and applications of sequential, parallel, and distributed algorithms, data structures, and computational complexity. The volume contains four invited presentations and 14 regular presentations selected from 32 submissions, each of which was evaluated by at least four program committee members. The invited presentations are by J. Hartmanis and S. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U. Vishkin, and M. Yannakakis HTTP:URL=https://doi.org/10.1007/3-540-57811-0

 類似資料