𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Time, money and tradeoffs

✍ Scribed by Bradford, David F.

Book ID
109774238
Publisher
Nature Publishing Group
Year
2001
Tongue
English
Weight
204 KB
Volume
410
Category
Article
ISSN
0028-0836

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Time and Money
Time and Money
✍ Jens Bonke; Mette Deding; Mette Lausten πŸ“‚ Article πŸ“… 2007 πŸ› Springer Netherlands 🌐 English βš– 224 KB
Time–Space Tradeoffs for Satisfiability
Time–Space Tradeoffs for Satisfiability
✍ Lance Fortnow πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 180 KB

We give the first nontrivial model-independent time space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved in n 1+o(1) time and n 1&= space for any =>0 general random-access nondeterministic Turing machines. In particular, SAT cannot be solved deterministically by a Turing mac

The heterogeneity of time–risk tradeoffs
The heterogeneity of time–risk tradeoffs
✍ Harrell Chesson; W. Kip Viscusi πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 115 KB

This paper uses an original sample of 146 business managers to examine the rationality of choices with respect to deferred lotteries. Using a new empirical methodology, it explicitly estimates implicit rates of time preference with respect to these deferred gambles. The estimated discount rate decre

Time–Space Tradeoffs for Branching Progr
Time–Space Tradeoffs for Branching Programs
✍ Paul Beame; T.S. Jayram; Michael Saks πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 265 KB

We obtain the first non-trivial time-space tradeoff lower bound for functions f: {0, 1} n Q {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1+e) n, for some constant e > 0. We also give the firs