29908 search results - page 579 / 5982 » On the Complexity of |
172
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
260
click to vote
LICS
2000
IEEE
15 years 11 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
208
click to vote
SIGDOC
2000
ACM
15 years 11 months ago
2000
ACM
We address two problems of technical authors in structured environments: (1) Structure definitions of the SGML school are limiting: they require one primary hierarchy and do not c...