Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. Join them; it only takes a minute:

Sign up

Here's how it works:

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

Explore Our Questions

active 1 featured hot week month

more tags

-1

votes

answer

views

Need help with comparing of elements one by one within a string

data-structures java

modified 17 mins ago Anjo 176

votes

answers

views

I have a problem understanding a solution for number theory problem from SPOJ

algorithms primes

asked 41 mins ago mac07 1

votes

answer

views

Mergesort recurssion tree depth…logs

algorithms

answered 1 hour ago Anjo 176

votes

answers

views

How to determine 10^logn and 3n^2 which grows faster asymptotically?

complexity-theory

answered 3 hours ago Rick Decker 9,056

votes

answer

views

Prove if $L = \{0^m1^n | m \neq n\}$ is regular or not

computability automata finite-automata pumping-lemma

modified 4 hours ago Rick Decker 9,056

votes

answers

views

Parameterized vertex cover on $r$-regular graphs

complexity-theory graphs clique

asked 6 hours ago Vitor 120

votes

answer

120

views

Distance vector in a weighted graph

algorithms graphs

modified 8 hours ago Community♦ 1

votes

answers

949

views

Do undecidable languages exist in constructivist logic?

formal-languages turing-machines logic proof-techniques undecidability

modified 11 hours ago jmite 13.2k

votes

answers

views

Why does this Pumping Lemma example show irregularity?

formal-languages regular-languages pumping-lemma

modified 11 hours ago Anjo 176

votes

answer

views

Solve Travelling Salesman once you know the distance of the shortest possible route

algorithms np traveling-salesman

answered 13 hours ago gnasher729 1,806

-2

votes

answers

views

How do I construct a palindrome from a given string using only replacement operations?

algorithms optimization strings substrings

modified 16 hours ago Sasa 1

votes

answers

views

Why are some programming languages turing complete but lack some abilities of other languages?

computability programming-languages turing-completeness

answered 16 hours ago Jörg W Mittag 161

votes

answers

157

views

Decidability of the TM's computing a none empty subset of total functions

computability turing-machines reductions undecidability

modified 18 hours ago Community♦ 1

votes

answers

views

Shortest paths in isomorphic graphs with different edge weights

algorithms graphs shortest-path graph-isomorphism

modified 20 hours ago devil0150 38

Browse More Questions

current community

your communities

more stack exchange communities

Explore Our Questions

Need help with comparing of elements one by one within a string

I have a problem understanding a solution for number theory problem from SPOJ

Mergesort recurssion tree depth…logs

How to determine 10^logn and 3n^2 which grows faster asymptotically?

Prove if $L = \{0^m1^n | m \neq n\}$ is regular or not

Parameterized vertex cover on $r$-regular graphs

Distance vector in a weighted graph

Do undecidable languages exist in constructivist logic?

Why does this Pumping Lemma example show irregularity?

Solve Travelling Salesman once you know the distance of the shortest possible route

How do I construct a palindrome from a given string using only replacement operations?

Why are some programming languages turing complete but lack some abilities of other languages?

Decidability of the TM's computing a none empty subset of total functions

Shortest paths in isomorphic graphs with different edge weights

Hot Network Questions