Posted
by Gail
on Stack Overflow
See other posts from Stack Overflow
or by Gail
Published on 2010-04-15T03:03:58Z
Indexed on
2010/04/15
3:13 UTC
Read the original article
Hit count: 150
As the question states, does the integer-factorization problem fall into the class of NP-Complete problems?
© Stack Overflow or respective owner
as seen on Programmers
- Search for 'Programmers'
Being a completely self taught programmer I would like it if I could better myself by self-learning computer science course taught to a typical CS grad.
Finding different resources on internet has been easy, there is of course MIT open course ware, and there are Coursera courses from Stanford and…
>>> More
as seen on Programmers
- Search for 'Programmers'
I'm 16 years old and really an enthusiast on web programming. I know (X)HTML, css, javascript and php. And i heard about computer science. Below are my question:
What is computer science?
Should a web programmer learn computer science?
If the answer of question 2 is yes, then what programming language(s)…
>>> More
as seen on Programmers
- Search for 'Programmers'
I'm 16 years old and really an enthusiast on web programming. I know (X)HTML, css, javascript and php. And i heard about computer science. Below are my question:
What is computer science is?
Should a web programmer learn computer science?
If the answer of question 2 is yes, then what programming…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi,
I am trying to figure out what 'topic' this is called, so I can learn more about it.
Basically, I'm talking about designing my applications's architecture. I'm not talking about algorithms. More like -- this class should have these methods and these instance variables, and communicate with…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I am looking for a good computer science resume. I just graduated, and I would like to see some samples from real programmers. The ones online don't seem that great. Sorry if this is posted in the wrong section.
>>> More
