11 search results - page 1 / 3 » Time-Space Tradeoffs for Branching Programs |
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
JCSS
2000
13 years 4 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
EUROSYS
2011
ACM
12 years 8 months ago
2011
ACM
Although they are helpful in many cases, state-of-the-art bug reporting systems may impose excessive overhead on users, leak private information, or provide little help to the dev...
ASPLOS
2006
ACM
13 years 11 months ago
2006
ACM
For transactional memory (TM) to achieve widespread acceptance, transactions should not be limited to the physical resources of any specific hardware implementation. TM systems s...
CN
2007
13 years 4 months ago
2007
— Energy efficient operation is of paramount importance for battery-powered wireless nodes. In an effort to conserve energy, standard protocols for WLANs have the provision for w...