|
509
committed
|
|
This proposal is now in the Beta phase
Top Example Questions
ON-TOPIC
How does the Mulmuley-Sohoni geometric approach to producing lower bounds avoid producing natural proofs (in the Razborov-Rudich sense)? 21 votesIs integer factorization an NP-complete problem? What notable reference works have covered this? 20 votes
Given a language L defined by a Turing Machine that decides it, is it possible to determine algorithmically whether L lies in NP? 20 votes
Are hash functions such as SHA-1, SHA-256 etc. provably “one-way” in their complexity, i.e. easy to compute and provably hard to reverse? 20 votes
In [ACM citation] I’m confused how the authors arrived at [assertion] from equation 2? 20 votes
view all questions
OFF-TOPIC
I want to write a program to solve a maze. How should I do it ? 25 votesI wrote this implementation of quicksort. Why does it seem to take exponential time? 22 votes
Which specification language (currently) has the best tool support? 20 votes
I’m interested in going to Graduate School for Computer Science. Any [Advice/Cautionary Tales]? 20 votes
At your university, is computable analysis studied in the CS dept or the math dept or both ? 20 votes
0
referred
30k
total rep
"Something for advanced Q&A in the CS field is long overdue."
committed Jul 30 at 21:30
0
referred
29k
total rep
"Cloud computing made efficient algorithms more important than ever. This is something I'm very interested in."
committed Jun 28 at 16:53
5
referred
54k
total rep
"This is a brilliant idea! Hope it's at least as successful as Math Overflow."
committed Jun 29 at 4:34
This site is in
Public Beta
Anyone can participate!
The site's progress will be evaluated in 70 days.
committed
509 committed
(51 per week)
first commit
2 months ago
latest commit
20 days ago
viewed
15,886 times
users also committed to
67.2% only this proposal
