Algorithms and Complexity: Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings [1 ed.] 3540578110, 9783540578116

The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February

294 76 2MB

English Pages 227 [230] Year 1994

Report DMCA / Copyright

DOWNLOAD DJVU FILE

Table of contents :
On the intellectual terrain around NP....Pages 1-11
Advances in graph drawing....Pages 12-21
On a parallel-algorithms method for string matching problems (overview)....Pages 22-32
Some open problems in approximation....Pages 33-39
New local search approximation techniques for maximum generalized satisfiability problems....Pages 40-53
Learning behaviors of automata from multiplicity and equivalence queries....Pages 54-62
Measures of Boolean function complexity based on Harmonic Analysis....Pages 63-72
Graph theory and interactive protocols for Reachability Problems on finite Cellular automata....Pages 73-90
Parallel pruning decomposition (PDS) and biconnected components of graphs....Pages 91-108
A non-interactive electronic cash system....Pages 109-124
A unified scheme for routing in expander based networks....Pages 125-135
Dynamization of backtrack-free search for the constraint satisfaction problem....Pages 136-151
Efficient reorganization of binary search trees....Pages 152-166
Time-message trade-offs for the weak unison problem....Pages 167-178
On set equality-testing....Pages 179-191
On the complexity of some reachability problems....Pages 192-202
On self-reducible sets of low information content....Pages 203-212
Lower bounds for merging on the hypercube....Pages 213-222

Algorithms and Complexity: Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings [1 ed.]
 3540578110, 9783540578116

  • 0 0 0
  • Like this paper and download? You can publish your own PDF file online for free in a few minutes! Sign Up
Recommend Papers