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 Hot Week Month
1 vote
1 answer
28 views

Expected runtime of recursive algorithm with optional part

Yuval Filmus
  • 271k
3 votes
0 answers
32 views

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

MC From Scratch
  • 131
1 vote
1 answer
15 views

Compressed string lookup by name or ordinal

D.W.♦
  • 145k
1 vote
0 answers
23 views

Product of all possible ranges in a sequence

Yuval Filmus
  • 271k
-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

Steven
  • 24.5k
0 votes
0 answers
18 views

Directed Acyclic Graph with minimized merging nodes

Payam
  • 1
-2 votes
0 answers
18 views

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

Tam-Fils Salomon
  • 97
1 vote
1 answer
28 views

Comparing the entropy of a painting to a photograph

D.W.♦
  • 145k
0 votes
3 answers
25 views

Minimising maximum sum algorithm

Ray Butterworth
  • 141
1 vote
0 answers
34 views

Method for simplifying complex logic tables

hotmeatballsoup
  • 111
1 vote
2 answers
49 views

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

MvB
  • 33
2 votes
1 answer
29 views

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

plshelp
  • 1,271
0 votes
0 answers
25 views

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

philipxy
  • 142
-2 votes
0 answers
17 views

Turing Machine- Regular language

cdonedone
  • 1
2 votes
1 answer
46 views

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

Yuval Filmus
  • 271k
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?

Peter Cordes
  • 831
5 votes
2 answers
1k views

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

John L.
  • 35.5k
-2 votes
0 answers
16 views

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

MUZAMIL ANWAR
  • 1
-2 votes
0 answers
16 views

Turing_Machine and Recursive Ennumerable language

user154040
  • 1
0 votes
0 answers
20 views

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

user154030
  • 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?

Steven
  • 24.5k
-3 votes
0 answers
23 views

What is wrong with my code? [closed]

user1211092
  • 1
-1 votes
1 answer
45 views

Complete Binary Tree

Rinkesh P
  • 537
0 votes
0 answers
14 views

How can I find a Stable Diffusion program?

M.N.Raia
  • 141
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?

Steven
  • 24.5k
1 vote
1 answer
33 views

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

Somnium
  • 265
0 votes
1 answer
33 views

BNF and EBNF Syntax for while loops in C#

rici
  • 11.4k
0 votes
1 answer
26 views

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

Steven
  • 24.5k
0 votes
1 answer
27 views

Uniformly random connected minimally cyclic graph algorithm

Dave Jarvis
  • 251
0 votes
1 answer
26 views

Construct an objective function that favors the sorted permutation

Steven
  • 24.5k
0 votes
0 answers
30 views

Network flow on multigraph easier than I thought?

Mehdi Saffar
  • 101
1 vote
1 answer
66 views

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

Yuval Filmus
  • 271k
1 vote
1 answer
24 views

Name of a packing problem similar to this?

Nathaniel
  • 7,569
4 votes
1 answer
80 views

Optimal algorithmic complexity of "a nonrepetitive stack"?

John L.
  • 35.5k
0 votes
0 answers
24 views

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

D.W.♦
  • 145k
0 votes
0 answers
30 views

Isomorphism, one-to-one correspondence in Stack

ihsingh2
  • 3
2 votes
0 answers
44 views

Find the darkest region in the sky

2080
  • 181
-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)

ComputerScienceMasteral
  • 1
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})$?

John L.
  • 35.5k
2 votes
1 answer
98 views

Dijkstra as a greedy algorithm

John L.
  • 35.5k
0 votes
0 answers
28 views

What is an "almost tight bound"

I am Clueless
  • 1
0 votes
1 answer
19 views

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

milembar
  • 101
-1 votes
0 answers
25 views

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

Kieran Anderson
  • 1
0 votes
0 answers
29 views

Is anyone good with Fitch style proofs?

Declan
  • 1
0 votes
1 answer
26 views

Improving an algorithm involving two pairs of sums

D.W.♦
  • 145k
-3 votes
0 answers
20 views

finite automation [closed]

ANY
  • 1

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.