Umfang:
Online-Ressource (VIII, 222 S.)
Ausgabe:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540483373
Serie:
Lecture notes in computer science 778
Inhalt:
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.
Inhalt:
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.
Anmerkung:
Literaturangaben
Weitere Ausg.:
ISBN 3540578110
Weitere Ausg.:
ISBN 9783540578116
Weitere Ausg.:
Erscheint auch als Druck-Ausgabe Algorithms and complexity Berlin : Springer, 1994 ISBN 3540578110
Weitere Ausg.:
ISBN 0387578110
Sprache:
Englisch
Fachgebiete:
Informatik
Schlagwort(e):
Algorithmus
;
Komplexitätstheorie
;
Algorithmentheorie
;
Konferenzschrift
DOI:
10.1007/3-540-57811-0
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
Bookmarklink
