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 algorithms
Search options not deleted
user 75269
An algorithm is a sequence of well-defined steps that defines an abstract solution to a problem. Use this tag when your issue is related to design and analysis of algorithms.
2
votes
0
answers
107
views
Code families with efficient decoding algorithms
I also know that Goppa codes and alternate codes have such algorithms due to Patterson. Hamming codes also belong to this category. …
- 313
2
votes
0
answers
66
views
Check if a matrix over finite fields is superregular
Is there any practical, efficient algorithm to check if a matrix over $\mathbf{F}_{p^n}$ is superregular?
It need not be theoretically polynomial, just roughly be implementable for $n=32$ and for ma …
- 313
1
vote
How many combinations will be generated if below conditions are put?
$2^{n-1}-1$
Hint: 1) if you are summing with $k$ numbers $x_1,x_2,.., x_k$ note that once you choose upto $k-1$, last selection is forced on you as the next ascending number to $x_{k-1}$.
2) You are …
- 313