<p>Read <a href="http://scienceblogs.com/thescian/2008/03/11/what-are-worthwhile-problems-f/" rel="nofollow">Feynman's letter</a>. Very good advice. </p>

<p>Always be curious and solve little problems you are good at. Eventually you will have enough solved for a major publication.</p>

CC BY-SA 3.0
2015-07-13T13:13:25.787Z
2015-07-13T13:13:25.787Z
Chad Brewbaker
<p>I am a theoratical computer science PhD student.</p>

<p>I am wanted some suggestion in how to find research problem for PhD research. I have supervisor and he has given me first problem. We had get progress in this. Now I have to do things fully by my self. Going conferences and workshop is not possible because of money problem.</p>

<p>In order to finding research problem what I do</p>

<pre><code>I open scholar.google site then I search different keywords from my area (which is word combinatorics)
If some thing look relevant then I read conclusion section
If I haven't understand then I go for introduction and abstract part
If I find ok then I read paper else left
</code></pre>

<p>Solving these kind of problems looks difficult. Earlier I had searched some problems and I had tried but I haven't get results as per in sending some conference. So I had left those problems. That is why I am wanted some input in this regards. </p>

CC BY-SA 3.0
2015-07-13T18:20:04.337Z
I think this might be more suitable for [academia.se]. I vaguely remember we had a question similar to yours about how to choose a problem to work on for thesis.
Kaveh
CC BY-SA 3.0
2015-07-13T22:32:27.033Z
Does word combinatorics include automata?  Take a look: http://cstheory.stackexchange.com/questions/22493/are-there-any-open-problems-left-about-dfas/22563#22563
Michael Wehar
CC BY-SA 3.0
2015-07-13T22:34:04.657Z
Also, some conferences have travel funds.  If you have a reason to attend and a recommendation from your adviser, then you can apply and hope to get most of your travel covered.
Michael Wehar
CC BY-SA 3.0
2015-07-13T22:34:31.817Z
If you would like to talk more, please let me know.  Have a nice day.  :)
Michael Wehar
CC BY-SA 3.0
2015-07-14T15:18:18.027Z
here is a [similar question](http://academia.stackexchange.com/questions/42679/is-it-acceptable-to-ask-a-professor-who-is-not-your-supervisor-to-give-you-m-s) from [academia.se] on a MS thesis topic. as stated it is generally frowned on by cyber denizens and academics to get thesis topics anywhere other than from an advisor. however, minority/ contrarian view, think this goes against grain of [open science](http://area51.stackexchange.com/proposals/65426/open-science). fyi heres list of many [near-open science](https://vzn1.wordpress.com/chat/) prjs by se users discussed/ announced in chat(s).
vzn
CC BY-SA 3.0
2015-07-14T23:14:12.260Z
ps also try [chat] and note that, in line with MWs idea, related work in any of the [leading/ famous open problems](http://cstheory.stackexchange.com/questions/174/major-unsolved-problems-in-theoretical-computer-science) is always an excellent research "bet"....
vzn
<co.combinatorics>
Finding research problem for PhD(TCS)?
msingh
# Finding research problem for PhD(TCS)?

(Asked by: username_0 on 2015-07-13)

I am a theoratical computer science PhD student.
I am wanted some suggestion in how to find research problem for PhD research. I have supervisor and he has given me first problem. We had get progress in this. Now I have to do things fully by my self. Going conferences and workshop is not possible because of money problem.
In order to finding research problem what I do
I open scholar.google site then I search different keywords from my area (which is word combinatorics)
If some thing look relevant then I read conclusion section
If I haven't understand then I go for introduction and abstract part
If I find ok then I read paper else left

Solving these kind of problems looks difficult. Earlier I had searched some problems and I had tried but I haven't get results as per in sending some conference. So I had left those problems. That is why I am wanted some input in this regards.

**Tags:** co.combinatorics
> **Comments:**
> **username_1**: I think this might be more suitable for [academia.se]. I vaguely remember we had a question similar to yours about how to choose a problem to work on for thesis.  
> **username_2**: Does word combinatorics include automata?  Take a look: http://cstheory.stackexchange.com/questions/22493/are-there-any-open-problems-left-about-dfas/22563#22563  
> **username_2**: Also, some conferences have travel funds.  If you have a reason to attend and a recommendation from your adviser, then you can apply and hope to get most of your travel covered.  
> **username_2**: If you would like to talk more, please let me know.  Have a nice day.  :)  
> **username_3**: here is a [similar question](http://academia.stackexchange.com/questions/42679/is-it-acceptable-to-ask-a-professor-who-is-not-your-supervisor-to-give-you-m-s) from [academia.se] on a MS thesis topic. as stated it is generally frowned on by cyber denizens and academics to get thesis topics anywhere other than from an advisor. however, minority/ contrarian view, think this goes against grain of [open science](http://area51.stackexchange.com/proposals/65426/open-science). fyi heres list of many [near-open science](https://vzn1.wordpress.com/chat/) prjs by se users discussed/ announced in chat(s).  
> **username_3**: ps also try [chat] and note that, in line with MWs idea, related work in any of the [leading/ famous open problems](http://cstheory.stackexchange.com/questions/174/major-unsolved-problems-in-theoretical-computer-science) is always an excellent research "bet"....  

---

## 1 answers

### Answer by username_4 on 2015-07-13. Score: 4

Read [Feynman's letter](http://scienceblogs.com/thescian/2008/03/11/what-are-worthwhile-problems-f/). Very good advice.

Always be curious and solve little problems you are good at. Eventually you will have enough solved for a major publication.


---

