๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of allocation problems in high-level synthesis

โœ Scribed by Klaus Jansen

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
691 KB
Volume
17
Category
Article
ISSN
0167-9260

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the complexity of equational problems
On the complexity of equational problems in CNF
โœ Reinhard Pichler ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 453 KB

Equational problems (i.e. first-order formulae with quantifier prefix โˆƒ \* โˆ€ \* , whose only predicate symbol is syntactic equality) are an important tool in many areas of automated deduction, e.g. restricting the set of ground instances of a clause via equational constraints allows the definition o

On the complexity of some geometric prob
On the complexity of some geometric problems in unbounded dimension
โœ Nimrod Megiddo ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 429 KB

This paper examines the complexity of several geometric problems due to unbounded dimension. The problems considered are: (i) minimum cover of points by unit cubes, (ii) minimum cover of points by unit ball% and (iii) minimum number of lines to hit a set of balls. Each of these problems is proven no

On the complexity of recursion in proble
On the complexity of recursion in problem-solving
โœ M.C. Er ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science โš– 426 KB

The importance of paying attention to the complexity of recursion in problem solving is stressed. Many ill-founded beliefs and doctrines on constructing recursive algorithms are challenged. The Tower of Hanoi problem and its variant are used as concrete examples for illustrating that many seemingly