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

1 vote
1 answer
28 views

Expected runtime of recursive algorithm with optional part

3 votes
0 answers
32 views

Counting integers $n \leq x$ with a given prime signature

1 vote
1 answer
15 views

Compressed string lookup by name or ordinal

1 vote
0 answers
23 views

Product of all possible ranges in a sequence

-2 votes
1 answer
20 views

Given x <= y, find a sum adding to y such that all elements are <= x and decreasing and the final element is maximised

0 votes
0 answers
18 views

Directed Acyclic Graph with minimized merging nodes

-2 votes
0 answers
18 views

What are other ways of finding Max and Min in python, other from my method?

1 vote
1 answer
28 views

Comparing the entropy of a painting to a photograph

0 votes
3 answers
25 views

Minimising maximum sum algorithm

1 vote
0 answers
34 views

Method for simplifying complex logic tables

1 vote
2 answers
49 views

How does the SMT solver Z3 handle conditional statements in a constraint?

2 votes
1 answer
29 views

What is an explanation of the replace operator in the Pie language?

0 votes
0 answers
25 views

Can quantifiers be used on variables bound on the left side of the pipe in Tuple Relational Calculus?

-2 votes
0 answers
17 views

Turing Machine- Regular language

2 votes
1 answer
46 views

What is the (intuitive) relation of NP-hard and #P-complete problems?

5 votes
3 answers
4k views

Is there a faster than O(n^2) way to compute a vector of length n from another vector and an n by n matrix?

5 votes
2 answers
1k views

Why does the order of the nested loops matter when solving the Coin Change problem?

-2 votes
0 answers
16 views

difference between * and For loop in python3.0 [closed]

-2 votes
0 answers
16 views

Turing_Machine and Recursive Ennumerable language

0 votes
0 answers
20 views

Proof: Leaf Nodes of a Binary Heap Start at ⌊n/2⌋+1

0 votes
1 answer
22 views

i am solving a question related to bfs traversal and there i got this doubt so can anyone plz solves this doubt?

-3 votes
0 answers
23 views

What is wrong with my code? [closed]

-1 votes
1 answer
45 views

Complete Binary Tree

0 votes
0 answers
14 views

How can I find a Stable Diffusion program?

0 votes
1 answer
43 views

In merge sort, what will be the time complexity if in each recursion, we break the array in two parts of size 1/4 and 3/4 respectively?

1 vote
1 answer
33 views

Best known deterministic algorithm for generation of any (non random) n-bit prime?

0 votes
1 answer
33 views

BNF and EBNF Syntax for while loops in C#

0 votes
1 answer
26 views

Examples of problems in NP but not in P which we haven't proved NP complete

0 votes
1 answer
27 views

Uniformly random connected minimally cyclic graph algorithm

0 votes
1 answer
26 views

Construct an objective function that favors the sorted permutation

0 votes
0 answers
30 views

Network flow on multigraph easier than I thought?

1 vote
1 answer
66 views

Show that $TIME(\sqrt{n})$ = $TIME(1)$

1 vote
1 answer
24 views

Name of a packing problem similar to this?

4 votes
1 answer
80 views

Optimal algorithmic complexity of "a nonrepetitive stack"?

0 votes
0 answers
24 views

Context free grammar of $ L=\{a^nb^m, n\neq 2m\} $ [duplicate]

0 votes
0 answers
30 views

Isomorphism, one-to-one correspondence in Stack

2 votes
0 answers
44 views

Find the darkest region in the sky

-1 votes
0 answers
23 views

Let S be a set with n > o elements. Let r be an integer such that 0≤r≤n. Then C(n,r)=C(n,n-r)

1 vote
1 answer
56 views

Why not $O(n^{\log_ba})$ for case 1 of the Master Theorem instead of $O(n^{(\log_ba) - \epsilon})$?

2 votes
1 answer
98 views

Dijkstra as a greedy algorithm

0 votes
0 answers
28 views

What is an "almost tight bound"

0 votes
1 answer
19 views

What is state novelty in reinforcement learning? And what the difference between state novelty and artificial curiosity?

-1 votes
0 answers
25 views

What is the quickest way to merge input symbols and remove blanks in a turing machine

0 votes
0 answers
29 views

Is anyone good with Fitch style proofs?

0 votes
1 answer
26 views

Improving an algorithm involving two pairs of sums

-3 votes
0 answers
20 views

finite automation [closed]


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