Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994 : proceedings
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 str...
Spremljeno u:
| Autor kompanije: | |
|---|---|
| Daljnji autori: | , , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
778 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithms and complexity, second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994, proceedings, M. Bonuccelli, P. Crescenzi, R. Petreschi, (eds.), Berlin, Springer-Verlag, 1994, 1 vol. (VIII-222 p.), Lecture notes in computer science, 0-387-57811-0 • Algorithms and Complexity, Texte imprimé, 9783662193198 |
Sadržaj:
- 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.