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 reference-request
Search options not deleted
user 8784
This tag is used if a reference is needed in a paper or textbook on a specific result.
1
vote
0
answers
282
views
Complexity of a problem related to 3D matching?
Given a set of triples of a base set $S$, find a subset of triples such that each element in $S$ appears exactly in one triple. This problem is NP-complete by reduction from NP-complete problem 3D Mat …
- 2,993
12
votes
4
answers
1k
views
How dense is the set of asymmetric graphs?
On $n$ nodes, we have $2^{n(n-1)/2}$ graphs. Asymmetric graph is a graph that has only trivial automorphism. We known that asymptotically almost all finite graphs are asymmetric. Therefore, in the lim …
- 2,993
6
votes
2
answers
455
views
Cubic graphs decompositions
There are many interesting computational problems related to connected cubic graph decomposition. For instance, decomposition of cubic graph into a perfect matching and a connected 2-factor (NP-comple …
- 2,993
3
votes
1
answer
317
views
Matrix transformation that "rotates" a matrix by $45^\circ$
I have an $n \times n$ integer matrix $A$. I want to obtain an $m \times m$ matrix $B$, where $m \ge n$, such that the rows of $A$ are the diagonals of $B$ and the columns of $A$ are the anti-diagonal …
- 2,993
5
votes
Accepted
Transforming a binary matrix into triangular form using permutation matrices
Luckily, the problem is no more in the "NP-limbo". The paper Obtaining a triangular matrix by independent row-column permutations Fertin, Rusu, and Vialette shows that the problem is NP-complete for b …
- 2,993