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 computer-science
Search options not deleted
user 2264
For question borderline with, or having application to, computer science. Consider also posting http://cs.stackexchange.com/ or http://cstheory.stackexchange.com/ instead of here, if appropriate.
2
votes
What is the name of the function f(x,y) = ((x-1) mod y)+1 ?
You could conceivably describe this as the "least positive residue" modulo y (as opposed to the "least non-negative residue" modulo y).
- 4,229
4
votes
Enumerative algorithm through inclusion-exclusion
Both yes and no. Let me illustrate...
Inclusion-exclusion is typically used to find the cardinality of a set A contain all combinatorial objects that avoid a substructure S (either that, or the comp …
- 4,229
13
votes
Accepted
Counting colored rook configurations in the cube - when is it even?
This can be phrased as a problem concerning Latin squares. Eg. a "rook set" is equivalent to a Latin square. For example:
123 100 010 001
231 <-> 001 100 010
312 010 001 100
A colou …
- 4,229