meta user
network profile
| bio | website | metindoslu.com |
|---|---|---|
| location | Istanbul, Turkey | |
| age | 26 | |
| visits | member for | 2 years, 2 months |
| seen | Apr 22 at 15:57 | |
| stats | profile views | 27 |
"The spiritual quest for elegance can turn the hacker into an artist."
|
Apr 22 |
awarded | Popular Question |
|
Apr 18 |
comment |
Network Analyses with Subgraphs Another research about subgraps: people.cam.cornell.edu/~jugander/subgraphs |
|
Apr 18 |
comment |
Network Analyses with Subgraphs Good directions, thanks. I suspect my subgraphs are not being simple so I don't expect higher frequencies for different subgraphs. One other point I really care about is how do they interact with other subgraphs such as does a specific subgraph very central to main graph? |
|
Apr 17 |
asked | Network Analyses with Subgraphs |
|
Feb 20 |
awarded | Popular Question |
|
Feb 11 |
awarded | Autobiographer |
|
Mar 22 |
accepted | How to show that $ALL_{DFA}$ is in P |
|
Mar 21 |
comment |
How to show that $ALL_{DFA}$ is in P I have understood edit part. Apart from that I could not see how using $\overline{ALL_{DFA}}$ additionally helps. |
|
Mar 21 |
awarded | Editor |
|
Mar 21 |
comment |
How to show that $ALL_{DFA}$ is in P @Mitch: Edited. |
|
Mar 21 |
revised |
How to show that $ALL_{DFA}$ is in P added 87 characters in body |
|
Mar 20 |
asked | How to show that $ALL_{DFA}$ is in P |
|
Mar 14 |
accepted | NP vs NP-Complete |
|
Mar 14 |
asked | NP vs NP-Complete |
|
Mar 8 |
awarded | Scholar |
|
Mar 8 |
accepted | Recognizable vs Decidable |
|
Mar 8 |
awarded | Supporter |
|
Mar 8 |
awarded | Student |
|
Mar 8 |
asked | Recognizable vs Decidable |
