3 search results - page 1 / 1 » Sharply Bounded Alternation and Quasilinear Time |
MST
1998
14 years 10 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
105
click to vote
JCSS
2000
14 years 10 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...
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...