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 answers only
not deleted
user 24076
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
Maximum number of $0$-$1$ vectors with a given rank
A construction for the lower bound: take the matrix of rank $k-1$ with $2^{k-1}$ columns consisting of all $\{0,1\}$-combinations of the vectors $e_1+e_2, e_3+e_4 \dots, e_{2k-3}+e_{2k-2}$. Then add t …
- 6,101
45
votes
Issue UPDATE: in graph theory, different definitions of edge crossing numbers - impact on ap...
Assuming an unpublished Ramsey-type result by Robertson and Seymour about Kuratowski minors [FK18, Claim 5], which is now "folklore" in the graph-minor community,
an asymptotic variant of the crossing …
- 6,101