Algorithms and Complexity: Second Italian Conference, Ciac '94, Rome, Italy, February 23-25, 1994 : Proceedings
Maurizio A. Bonuccelli, Pierluigi Crescenzi, Rossella Petreschi · Medical Entomology and Zoology · 1994
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.