Scheduling arithmetic and load operations in parallel with no spilling. Computing simple circuits from a set of line segments is NP-complete. Umesh V. Vazirani and Vijay V. Vazirani . Approximating the permanent. A correction network for N -sorters.
Geometry helps in matching.
On relaxed squashed embedding of graphs into a hypercube. Simple fast algorithms for the editing distance between trees and related problems. Bala Ravikumar and Oscar H. Ibarra . Relating the type of ambiguity of finite automata to the succinctness of their representation. Allan Borodin , Stephen A. Cook , Patrick W. Dymond , Walter L. Ruzzo , and Martin Tompa .