Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Top Questions

4 answers
13 votes
3k views
Why is tail recursion better than regular recursion?
2 answers
7 votes
3k views
Is the Berkeley tutorial on Fibonacci trees using wrong figures?
1 answer
5 votes
486 views
Why are $\sf{P} \ne \sf{NP}$ and $\sf{NP} \ne \sf{coNP}$ compatible?
2 answers
6 votes
231 views
What edges are not in a Gabriel graph, yet in a Delauney graph?
1 answer
4 votes
512 views
How could you encode such a function in lambda calculus?
1 answer
4 votes
407 views
What are the fundamentals of calculating space complexity in loops?
2 answers
-2 votes
172 views
What are some problems in EXPTIME not known to be EXPTIME-complete?
1 answer
3 votes
164 views
Designing a Queue that efficiently tracks position
2 answers
1 vote
59 views
Is it accurate to contrast a Turing machine with finite automata by claiming the former is stateful and the latter is pure?
1 answer
3 votes
152 views
Efficient intersection of equivalence classes
1 answer
4 votes
116 views
Parition a multiset of numbers into two subsets, how to maximize the sum of their medians?
2 answers
1 vote
79 views
Hash maps vs extending structs / classes
1 answer
0 votes
189 views
Turing machine with infinite tape alphabet
1 answer
4 votes
68 views
Attempt to reduce to problem of inner product
3 answers
2 votes
57 views
Why is M^e mod N the ciphertext and not just M^e
1 answer
3 votes
83 views
Is NL closed under complemenrt?
2 answers
3 votes
56 views
Why do we not use continuous real quantities to represent continuous numbers
1 answer
3 votes
55 views
Relation between $P$ vs $\mathit{NP}$ and $P^{\mathit{NP}}$ vs $\mathit{NP}^{\mathit{NP}}$ questions?
2 answers
1 vote
54 views
Iterable hash table
2 answers
1 vote
41 views
What are some problems in EXP not known to be EXPTIME-Complete, but also do not have any known algorithm in NP?
2 answers
3 votes
66 views
Given a vector of points, what is the fastest algorithm to find all pairs of points at a distance of 1?
2 answers
1 vote
106 views
Algorithm to convert a large number (output of a hashing algorithm) into something easily compared visually by humans?
1 answer
4 votes
62 views
$\{uuv\mid u\in\Sigma^+, v\in \Sigma^*\}$ and pumping lemma
1 answer
3 votes
62 views
Can it be NP hard to calculate the value of a function?
2 answers
0 votes
76 views
Can we DISPROVE that a problem is NP-complete
1 answer
2 votes
74 views
D* Lite - can edge costs be asymmetric?
2 answers
1 vote
71 views
How can I write 2^65 on my 64-bit computer?
0 answers
5 votes
89 views
Optimization problem with discrete and continuous components
3 answers
2 votes
87 views
Proving that a class equals NP ∩ coNP
2 answers
2 votes
86 views
What if solving P vs NP revealed a contradiction?
1 answer
2 votes
52 views
Maximum independent subset for graphs with lots of edges
1 answer
2 votes
65 views
Proof that if the residual network of a max flow has no cycles then the max flow is unique
2 answers
2 votes
83 views
Bin-packing with a capacity constraint on pairs of bins
1 answer
0 votes
63 views
Trivial Proof that EXP = PSPACE(im 99% sure i'm doing somthing wrong.)
1 answer
0 votes
61 views
Is $\Sigma^*$ countable or uncountable?
1 answer
1 vote
78 views
define the head expressions
2 answers
0 votes
74 views
Is Python truly OOP?
2 answers
0 votes
95 views
How do I find out what SPACE a language has?
0 answers
0 votes
92 views
Find a bipartition of points using blackbox
0 answers
5 votes
71 views
+50
Optimization on hypergraph "refinements"
2 answers
0 votes
43 views
Solving time of large TSP instances
1 answer
1 vote
43 views
If Interpreters are used to run code and are written in another language, won't interpreters need interpreters?
1 answer
0 votes
70 views
Find most vertices in a directed tree where no path of length less than 3 connects any pair
1 answer
-1 votes
70 views
if P=NP, and if language A is not NP-hard, A = ∅ or A = Σ*
1 answer
1 vote
53 views
Whether and how to distinguish two kinds of $O(1)$ speedup
2 answers
0 votes
51 views
Can a software program be stored in just one memory cell?
1 answer
1 vote
30 views
Is the following function computable? is it total?
1 answer
0 votes
49 views
Randomized Algorithm Log-Space Exp-Time

Looking for more? Browse the complete list of questions, or popular tags. Help us answer unanswered questions.