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 9417
Informally, an algorithm is a set of explicit instructions used to solve a problem (e.g. Euclid's algorithm for computing the greatest common divisor of two integers). For more specific questions on algorithms, this tag may be used in conjunction with the approximation-algorithms, algorithmic-randomness and algorithmic-topology tags.
0
votes
What are the applications of hypergraphs?
I'll go ahead and plug a paper of mine in the hopes it will generate more interest in it, Boolean formulae, hypergraphs, and combinatorial topology which I wrote with my student Oliver Thistlethwaite …
- 4,898
13
votes
3
answers
739
views
Algorithm for detecting ribbon or slice links?
As far as I know, there are no algorithms for all three of these questions. My question is whether this is really true. For example, is there an algorithm to detect whether a link is ribbon? …
- 1,590
3
votes
NP-Hard solution question
By definition, an NP hard problem must be a decision problem. That means it must have an answer of "yes" or "no," based on any given input. So it can't have "multiple answers."
- 4,898