Computer Science

Teacher

 Teacher
Answer a question with score of 1 or more.
Awarded 5585 times.
What is the significance of negative weight edges in a graph?
Awarded 5 hours ago
How to design PDA for this language?
Awarded 19 hours ago
Proof in the "Reaching Agreement in the Presence of Faults"
Awarded yesterday
Request for Good Encyclopedic works of computer science
Awarded yesterday
Real life examples of negative weight edges in graphs
Awarded 2 days ago
Are sample memory access traces/dumps available, and where?
Awarded Dec 2 at 6:40
Having a lot of trouble trying to reason the formal definition of Big O
Awarded Dec 1 at 11:38
Solving $UCYCLE$ in logspace - two possible approaches ? Why can't we one of them use to solve connectivity?
Awarded Nov 30 at 15:35
non deterministic space hierarchy
Awarded Nov 29 at 20:57
Prove my algorithm that solves ABC String problem in Codeforces is correct
Awarded Nov 26 at 4:17
Booth bit-pair recoding technique
Awarded Nov 24 at 19:26
Maximum flow on a n ×n grid
Awarded Nov 23 at 10:08
Algorithmn for SIMD matrix multiplication
Awarded Nov 22 at 12:06
CISC and RISC - synchronous and asynchronous
Awarded Nov 21 at 23:45
Algorithm to check Gibbs' Phase Rule
Awarded Nov 21 at 5:26
CISC and RISC - synchronous and asynchronous
Awarded Nov 21 at 0:56
Does the Minimum Spanning Tree include the TWO lowest cost edges?
Awarded Nov 19 at 19:20
How to remove a universal quantifier in Lean theorem prover
Awarded Nov 19 at 18:17
What is the difference between NP hard and NP complete?
Awarded Nov 18 at 7:21
Why can $2$-SAT be solvable efficiently, but $3$-SAT not?
Awarded Nov 17 at 4:04
Sequential History in Herlihy and Wing's Linearizability paper
Awarded Nov 16 at 22:34
If $\Sigma_i^P = \Sigma_{i+1}^P$ then for all $k \ge i$ holds $\Sigma_k^P = \Sigma_{k+1}^P$
Awarded Nov 16 at 22:34
Eulerian Path and Circuit Algorithm - How does it work?
Awarded Nov 16 at 10:46
Linear programming infeasible problems
Awarded Nov 15 at 21:05
What is the sensitivity of gradient clipping in Differentially Private SGD?
Awarded Nov 15 at 21:05
CFG for L={a^i b^j c^i; i,j > 0}
Awarded Nov 15 at 21:05
$L_p$ contains all binary strings whose value as binary number is prime. What are those values?
Awarded Nov 15 at 21:05
Minimizing number of MxM squared tiles in an infinite grid covered by any part of a shape
Awarded Nov 13 at 8:48
When you convert epsilon NFA to NFA, how do you decide the final states of resultant NFA?
Awarded Nov 13 at 8:48
How does a CPU do function calls?
Awarded Nov 12 at 21:06
How should i face the cluster editing problem?
Awarded Nov 12 at 4:18
Explicit form of Hofstadters bluediag in floop
Awarded Nov 11 at 22:40
Algorithm best compare similarities between two data sets in percentage
Awarded Nov 11 at 20:20
CLRS - Maxflow Augmented Flow Lemma 26.1 - don't understand use of def. in proof
Awarded Nov 11 at 6:04
How can any non-primitive-recursive function like the Ackermann function be implemented on hardware?
Awarded Nov 9 at 21:08
Unstable nature of Lomuto partition scheme
Awarded Nov 9 at 4:41
How to simulate a bidirectional TM on a regular one with time factor four?
Awarded Nov 9 at 2:42
Josephus Problem - A faster Solution
Awarded Nov 9 at 0:32
How to prove Big-O when $f(n)$ is defined sectionwise
Awarded Nov 8 at 6:41
Design a DFA that accepts language L={ x in (0,1)* | the third bit from x from its right end is 1}
Awarded Nov 8 at 2:03
Coming up with a loop invariant for the partition section Quicksort?
Awarded Nov 7 at 3:05
Find the class of the problem PP1 and PP2 using the information given below
Awarded Nov 5 at 15:18
Given n positive integers, pick two elements and subtract each by one with one operation. Find max operations
Awarded Nov 5 at 0:20
Are there any programming languages that support state machines in their standard library?
Awarded Nov 3 at 22:37
How to arrive at correct preconditions and postconditions?
Awarded Nov 3 at 7:42
What are pointers in low-level language like C
Awarded Nov 1 at 17:41
Look Ahead buffer vs Translation Look aside buffer
Awarded Nov 1 at 16:09
how to find all negative weight cycles(elementary circuit) in a strongly connected directed graph?
Awarded Oct 31 at 20:16
Ip address release/renew
Awarded Oct 29 at 3:08
Proving L = {$ { a^{2^n} \ | \ n \ge 0 } $} is not regular by use of Pumping Lemma
Awarded Oct 28 at 5:47
How many different (full/complete) in-order binary-trees do exist?
Awarded Oct 28 at 5:15
Matching two noisy / lossy versions of the same data stream to each other
Awarded Oct 27 at 20:26
What class is the language $(C,(v_i)_{i=1}^m,x)$ complete to s.t. $C(x)$ is a boolean circuit with $m$ gates with values $\{v_i\}_{i=1}^m$
Awarded Oct 27 at 14:50
Red-Black tree height from CLRS
Awarded Oct 27 at 9:05
About Steiner tree problem in graphs
Awarded Oct 25 at 19:07
Encoding a binary sequence with shift in MILP
Awarded Oct 25 at 9:57
what is the time complexity of this for for for if
Awarded Oct 25 at 7:41
Determine page number and offsets for address references
Awarded Oct 24 at 13:40
Is it possible to build a computer whose "ALU" is a single NAND gate?
Awarded Oct 24 at 9:26
Big Oh vs Big Theta
Awarded Oct 24 at 4:40
1
2 3 4 5
…
94

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.