How may an algorithm always color optimally connected bipartite graphs?

7yr ⋅

⋅

ADVERTISEMENT

The Height of subtree in Heap

7yr ⋅

⋅

Number of n-node binary trees containing an m-node binary subtree

7yr ⋅

⋅

Turning a simple polygon with holes into exterior-bounded only

9yr ⋅

⋅

Show that if Automata $A$ recognize language $L$, there also exists an automata $A′$ that recognize $Double(L)$

7yr ⋅

⋅

Minimax algorithm when all the options are the same

8yr ⋅

⋅

Is a 2 address machine more likely to follow a RISC or CISC design?

9yr ⋅

⋅

Which method is preferred for storing large geometric objects in a quadtree?

13yr ⋅

⋅

Recurrence relation of the coin change problem

7yr ⋅

⋅

Finding a maximal set of nonintersecting line segments in a unit circle

8yr ⋅

⋅

Equivalent expression in English: Set Notation $\\{0,1\\}^K$

7yr ⋅

⋅

What does apostrophe-like symbol in the superscript mean?

10yr ⋅

⋅

Why do caches fetch data to the right if the offset bit is 0 and to the left if it is 1 in a 2-word block

8yr ⋅

⋅

Minimum-weight shortest-path tree

7yr ⋅

⋅

Average Cost Threshold Protocol with Minimum Thresholds: How to find the price?

8yr ⋅

⋅

Segmenting a human body point cloud into limbs

8yr ⋅

⋅

Internal tangent intersection of two point sets in linear time

7yr ⋅

⋅

Choosing nonzero entries from an array so no pair in same row or column

9yr ⋅

⋅

How does a TLB and data cache work?

11yr ⋅

⋅

Finding the interior of a connected graph

9yr ⋅

⋅

Perfect matching in a graph and complete matching in bipartite graph

9yr ⋅

⋅

How to understand the SR Latch

12yr ⋅

⋅

ADVERTISEMENT

Application of a directed almost tree

8yr ⋅

⋅

Karger's algorithm: why does every vertex have degree at least the number of edges crossing a min cut?

8yr ⋅

⋅

Why is the running time for BFS $O(b^{d+1})$?

8yr ⋅

⋅

Which class of languages is accepted by PDA when we restrict the stack to logarithmic size?

10yr ⋅

⋅

When does a PDA split?

9yr ⋅

⋅

Easiest improvement on first-fit for bin packing algorithm

9yr ⋅

⋅

Finding any path between nodes of implicit, finite, regular, undirected graph

8yr ⋅

⋅

Help with understanding Hopcroft's algorithm

9yr ⋅

⋅

FPT algorithm for point line cover

9yr ⋅

⋅

Least squares fit of a 1D lattice of points to a 2D dataset

8yr ⋅

⋅

Is there a flaw in this Wikipedia proof of cycle property of Minimum Spanning Tree?

10yr ⋅

⋅

How to extract randomness from a file?

9yr ⋅

⋅

Length of the solution calculation in Breadth-first

8yr ⋅

⋅

Locality-sensitive hashing random projection

8yr ⋅

⋅

Generating graphs such as found on Sedgewick's Algorithms book on the MST chapters

9yr ⋅

⋅

ADVERTISEMENT

Why update weights and biases after training a Neural Network on whole set of training samples

8yr ⋅

⋅

Finding Shortest Paths of weighted graph using stacks

11yr ⋅

⋅

Deep DFS traverse on graph

8yr ⋅

⋅

Understanding the Broyden–Fletcher–Goldfarb–Shanno Algorithm to Select Weights for Neural Nets

8yr ⋅

⋅

Vertex cover of a graph by removing leaf-vertices from a DFS tree

8yr ⋅

⋅

Proving the lower bound of compares in comparison based sorting

10yr ⋅

⋅

Sort an array based on dependencies

8yr ⋅

⋅

Maximizing sum of ranges of vertices edges

10yr ⋅

⋅

Is this probability distribution data structure already discovered?

8yr ⋅

⋅

Minimal spanning tree with degree constraint

10yr ⋅

⋅

Computing maximum-cost subtree that uses at most k edges

8yr ⋅

⋅

Choosing taps for Linear Feedback Shift Register

13yr ⋅

⋅

Reinforcement Learning - Q Learning

8yr ⋅

⋅

Maximum number of matched vertexes in a one-to-many bipartite graph

10yr ⋅

⋅

Is this method of proving non-regularity is equivalent to pumping lemma?

9yr ⋅

⋅

ADVERTISEMENT

How to convert an NFA with overlapping cycles into a regular expression?

13yr ⋅

⋅

Decremental reachability in a grid graph

10yr ⋅

⋅

Are all context-free and regular languages efficiently decidable?

13yr ⋅

⋅

Sum of 3 integers with full adder

8yr ⋅

⋅

More than one NFA accepting a given language

11yr ⋅

⋅

NP-Completeness of a Graph Coloring Problem

12yr ⋅

⋅

What is the rigorous definition of an efficient algorithm that $\\epsilon-refutes$ random 3CNF formulas

9yr ⋅

⋅

How does a recurrent connection in a neural network work?

8yr ⋅

⋅

What is the reason of inaccuracy of operations on float numbers?

11yr ⋅

⋅

ADVERTISEMENT

How does the 3-opt algorithm for TSP work?

11yr ⋅

⋅

How to prove that $n$ sets have maximum of $2^n-1$ disjoint subsets when you have operations $\\cup , \\cap , \\setminus$?

8yr ⋅

⋅

Rollback and Timestamp Ordering in Database

9yr ⋅

⋅

How to draw a clearly arranged DFA of a language with modulo rules?

9yr ⋅

⋅

Halting Problem and Turing Degree and Reduction?

9yr ⋅

⋅

Description and semantics of program graphs

9yr ⋅

⋅

How does RAID-5 algorithm locate the right device?

8yr ⋅

⋅

Finding the height of all nodes in a forest

12yr ⋅

⋅

Why there is light source?

9yr ⋅

⋅

Deterministic vs. Non-Deterministic PDA?

8yr ⋅

⋅

How many different heaps are there of a given shape?

8yr ⋅

⋅

Dijkstra algorithm vs breadth first search for shortest path in graph

11yr ⋅

⋅

Efficient way to calculate sum in sliding window?

9yr ⋅

⋅

Is it legal to draw an NFA with fewer nodes than what I normally see?

8yr ⋅

⋅

ADVERTISEMENT

Select the maximum number of links to satisfy per-link constraint. How to prove is NP-hard?

8yr ⋅

⋅

Probability bounds on size of smaller partition in randomized quicksort

8yr ⋅

⋅

How can I draw a Moore diagram for a given circuit?

8yr ⋅

⋅

Count the number of Euler PATHs in directed graph?

8yr ⋅

⋅

What is this question asking for?-->Test this code, find an error in the program and construct an instance to demonstrate the error (in C)

8yr ⋅

⋅

Lambda Calculus Notation

10yr ⋅

⋅

Connecting an unconnected forest of subtrees in a graph?

8yr ⋅

⋅

Why is c) a combinational circuit, but d) not?

9yr ⋅

⋅

Is there a simple way of calculating perceptron weights based on a classification graph?

12yr ⋅

⋅

Why is this NPDA?

9yr ⋅

⋅

Is this intersection of DFAs correct?

12yr ⋅

⋅

Confusion in CLRS's version of Prim's algorithm

9yr ⋅

⋅

Prim's algorithm: difference between brute force and PQ approaches

9yr ⋅

⋅

Finding negative cycles for cycle-canceling algorithm

12yr ⋅

⋅

ADVERTISEMENT

Why do puzzles like Masyu lie in NP?

9yr ⋅

⋅

Efficiently representing a set of sets

10yr ⋅

⋅

Cross Edge and Back Edge when doing BFS

7yr ⋅

⋅

Does Peterson's 2-process mutual exclusion algorithm account for dying processes?

13yr ⋅

⋅

Question about ε-moves at $\\varepsilon NFA$

9yr ⋅

⋅

QuickSort Dijkstra 3-Way Partitioning: why the extra swapping?

10yr ⋅

⋅

What is the maximum number of shortest paths between any pair of vertices in a chordal graph?

12yr ⋅

⋅

Why is log(n/p) asymptotically less than log(n)/log(p)

11yr ⋅

⋅

How to convert a Turing Machine program to a tiling using Wang Tiles?

11yr ⋅

⋅

Is there a non-brute force algorithm for Eulerization of graphs?

12yr ⋅

⋅

How many basic operations are there in an algorithm for the simple multiplication of two numbers of equal length?

9yr ⋅

⋅

What happens if we expand the alphabet of a given Turing Machine?

9yr ⋅

⋅

AVL Trees Height-Balance Property

9yr ⋅

⋅

ADVERTISEMENT

XOR-like behavior in flow networks

12yr ⋅

⋅

Combining multiple HMM models

10yr ⋅

⋅

Understanding the one-writer, many-readers problem?

9yr ⋅

⋅

Space complexity analysis of binary recursive sum algorithm

10yr ⋅

⋅

Problem regarding Turing Machine notation

11yr ⋅

⋅

How, in hardware, MIPS can access a word in the middle of an address

10yr ⋅

⋅

Finding cache block transfer time in a 3 level memory system

11yr ⋅

⋅

without triangle inequality, finding good approximate tours for TSP in polynomial time is impossible unless P=NP?

11yr ⋅

⋅

Finding paths with smallest maximum edge weight

12yr ⋅

⋅

Moore's law and Clock Speed

10yr ⋅

⋅

Graph Theory Handshaking problem

10yr ⋅

⋅

Relation between the Point-Cover-Interval problem and the Interval Scheduling problem

9yr ⋅

⋅

Is this problem NP-hard?

9yr ⋅

⋅

Sorting numbers in $O(1)$

10yr ⋅

⋅

What is the name of this logistic variant of TSP?

13yr ⋅

⋅

Efficient queriable data structure to represent a screen with windows on it

13yr ⋅

⋅

Why is f(n) of class O(g(n)) in this graph?

9yr ⋅

⋅

Minimizing Cost by minimizing delay

10yr ⋅

⋅

ADVERTISEMENT

What use are the minimum values on minimax trees?

13yr ⋅

⋅

Covering a graph with non-overlapping cliques

9yr ⋅

⋅

What is this trapezoid-shaped logic component?

9yr ⋅

⋅

A little confusion with the Knapsack problem (a worked example)

9yr ⋅

⋅

Does last carry bit get added onto the sum calculated by full adder?

9yr ⋅

⋅

Disco Zoo Complexity

9yr ⋅

⋅

Role of Term Constants in Simply Typed Lambda Calculus

10yr ⋅

⋅

Are there repositories of automatically generated (spam) webpages?

11yr ⋅

⋅

Bin packing problem or not?

11yr ⋅

⋅

Proof via induction for small-step semantics

9yr ⋅

⋅

Is the following NP-complete?

12yr ⋅

⋅

Why is 'Manhattan distance' a better heuristic for 15 puzzle than 'number of tiles misplaced'?

10yr ⋅

⋅

Is “Find the shortest tour from a to z passing each node once in a directed graph” NP-complete?

11yr ⋅

⋅

ADVERTISEMENT

How can an extended linearizable history G be equivalent to sequential history S?

11yr ⋅

⋅

Program compilation and execution flow

12yr ⋅

⋅

Transform unstructured flow charts into structured ones

10yr ⋅

⋅

Prove that the Language is Recognizable

11yr ⋅

⋅

What is the average turnaround time?

13yr ⋅

⋅