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
Computer Science

Top Questions

Ask Question
Active 1 Bountied Hot Week Month
0 votes
2 answers
24 views

Best data structure in C++ to store bodies in an N-body simulation?

harold
  • 1,903
0 votes
0 answers
13 views

Reduction from Diophantine Equation Problem to Halting Problem

Mgh
  • 1
0 votes
2 answers
27 views

How to find the standard theta notation of this?

Salty Champ
  • 16
1 vote
1 answer
76 views

What is the smallest NFA you can design for {a^n : n =/= 1003}

Steven
  • 25.6k
0 votes
0 answers
11 views

Range updates in segment trees of sorted arrays (merge sort trees)

Yuvraj Sakshith
  • 119
1 vote
1 answer
25 views

Encoding "all-except" constraints in CNF

pcpthm
  • 2,105
0 votes
1 answer
67 views

Is this sorting problem NP-complete?

Soroush Vahidi
  • 1
2 votes
1 answer
62 views

Is there a name for this kind of binary tree?

Hendrik Jan
  • 28.7k
1 vote
1 answer
18 views

Are the indices of variables in the formula variable?

advocateofnone
  • 2,903
0 votes
0 answers
20 views

Linearly independent paths with loops and cyclomatic complexity

jack malkovick
  • 229
1 vote
0 answers
12 views

Applying Baum-Welch to multiple observed sequences iteratively

felher
  • 11
-1 votes
0 answers
13 views

How is it possible to "lock" device's software?

user157394
  • 1
-3 votes
0 answers
15 views

Binary Sequence

Logan Michaelson
  • 1
4 votes
1 answer
61 views

Possibly Tractable Variation of Suguru Puzzles

John L.
  • 36.8k
0 votes
2 answers
37 views

Finding the length of the longest palindrome in the given array

Salty Champ
  • 16
11 votes
3 answers
2k views

Detecting if three Turing Machines halt given a magic oracle that is only used twice

lombardo2
  • 121
0 votes
0 answers
28 views

Divide and conquer problem

Kashish
  • 3
2 votes
1 answer
34 views

Find if there is more than one path between two vertices such that no vertices are used more than once

D.W.♦
  • 149k
0 votes
1 answer
51 views

Why is a LALR parser the correct choice for parsing mathematical content? (a question about Approach0)

rici
  • 11.7k
1 vote
1 answer
132 views

Finding Optimal Configuration of Formula without trying every Permutation

Command Master
  • 193
0 votes
1 answer
30 views

Why is flex the best choice for handling mathematical content? (a question about approach0)

rici
  • 11.7k
-1 votes
0 answers
16 views

Inequation Proof - Graph Optimization

Airam
  • 1
2 votes
1 answer
15 views

Finding general time complexity for recurrence relation $T(n)=aT(n/\alpha)+bT(\beta n/\alpha)+f(n)$

Yuval Filmus
  • 273k
5 votes
4 answers
2k views

How does the linker know where to look for a function implementation in C++?

tripleee
  • 125
0 votes
1 answer
48 views

Time complexity of T(n) = 1600T(n/4) + n!

Nathaniel
  • 11.5k
2 votes
1 answer
36 views

Is checking whether a a set of 3-literal clause is satisfiable such that every literal in each clause is either all true or all false NP-complete?

Steven
  • 25.6k
1 vote
0 answers
13 views

Determining when a substring has a unique parse forest

breandan
  • 123
0 votes
0 answers
12 views

Does plantri software provide the option to screen out abstract non-isomorphic graphs

licheng
  • 121
0 votes
1 answer
47 views

Set of all vertices in a directed tree that are within distance of strictly larger than 2

Salty Champ
  • 16
1 vote
2 answers
87 views

Definition of complexity of an algorithm

D.W.♦
  • 149k
0 votes
1 answer
26 views

Strong NP-completeness of permuted kernel problem

D.W.♦
  • 149k
0 votes
1 answer
23 views

Given a graph `G`, what is the maximum number of "minimum" cycles it could have?

Steven
  • 25.6k
0 votes
0 answers
19 views

Manipulating a binary tree representation

Jordan K
  • 1
0 votes
0 answers
20 views

What type of tree traversal should be performed to obtain the same splay tree?

vesii
  • 231
0 votes
0 answers
29 views

Is there any way to tell which states are final states in a finite state automata given only its grammar?

Brett Smith
  • 1
0 votes
1 answer
34 views

O(nlogn)-time complexity

Yves Daoust
  • 7,186
1 vote
3 answers
43 views

What set.seed() mean in the Monte Carlo method

Yves Daoust
  • 7,186
0 votes
1 answer
92 views

What is this question actually asking for me to solve?

Yves Daoust
  • 7,186
1 vote
0 answers
60 views

Successive shortest paths with fixed costs and costs per unit

Gabriel Rebello
  • 111
2 votes
0 answers
33 views

How to delete node from RB-tree

Euler-Maskerony
  • 21
3 votes
1 answer
48 views

Building the minimal automaton from the syntactic monoid of a language

Rémi
  • 51
0 votes
1 answer
45 views

Is there a way to make a implication graph of the following expression?

Iqazra
  • 126
0 votes
1 answer
17 views

Are there any other language classes of time complexity between the P language class and the NP language class?

PMar
  • 1
0 votes
0 answers
38 views

Goedel's theorem, halting problem and irreducible complexity

Wasabi Kurosawa
  • 29
1 vote
1 answer
44 views

maximum span between two numbers

D.W.♦
  • 149k
0 votes
2 answers
42 views

If an array is stored from higher region of memory to lower region, how'll the indexing formula look like?

Yves Daoust
  • 7,186
0 votes
1 answer
42 views

Does the OS come in the hard drive?

Juho
  • 22.2k

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

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.