Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with time-complexity
Search options not deleted
user 64784
Time complexity of decision problems or relations among time-bounded complexity classes. (Use the [analysis-of-algorithms] tag for the time taken by particular algorithms.)
1
vote
Accepted
Calculation on Sparsification and critical clauses in SAT
First part:
$2^{h(\delta)n}+2^{\epsilon n}+2^{\epsilon n}2^{(s_k+ \epsilon)(1-(\delta/ek))n} \leq 2^{(s_\infty(1-d/k)+2\epsilon)n}$
$\implies2^{(s_\infty/2)n} + 2^{(s_k+ \epsilon)(1-(\delta/ek))n +\ep …
- 109
-1
votes
1
answer
192
views
Calculation on Sparsification and critical clauses in SAT
I followed from this question.
I need to prove, the final result $s_k \leq (1 − \Omega(k^{−1}))s_{\infty}.$
But before prove the final result first I need to prove the $s_k \leq (1 − d/k))s_{\infty}$. …
- 109