#### Filter Results:

#### Publication Year

1981

1983

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

It is demonstrated that usual time-memory trade-offs offer no asymptotic advantage over exhaustive search. Instead, trade-offs between time, memory, and parallel processing are proposed. Using this approach it is shown that most searching problems allow a trade-off machine which achieves this has an unusual architecture, with a number of processors sharing… (More)

Extended Abstract Given a vector a=(al, a~ ..... u.,~) where each % is a positive integer, and an integer S, the knapsack problem is to fond a binary vector x=(zb z2 ..... z-,~) such that ll (1) i=l The associated decision problem, i.e.,determining whether (i) has a solution, is Lb. the class of NP-Complete problems. Therefore it is believed that solving… (More)

- ‹
- 1
- ›