If P = NP, why does P = NP = NP-Complete?

10yr ⋅

⋅

ADVERTISEMENT

Karnaugh map simplification

10yr ⋅

⋅

Encoding algorithms better than or equivalent to Run Length Encoding

11yr ⋅

⋅

Hamming distance required for error detection and correction

10yr ⋅

⋅

A real-world example for a kind of real-time applications

10yr ⋅

⋅

Finding paths of certain length in trees

10yr ⋅

⋅

Source Coding Theorem: what happen when go below N⋅H(x) bits?

10yr ⋅

⋅

Relationship between message entropy and complexity of the best algorithm

10yr ⋅

⋅

What is the TAK function for?

12yr ⋅

⋅

How exactly the load word instruction loads from RAM?

10yr ⋅

⋅

Polygons generated by a set of segments

13yr ⋅

⋅

Problem understanding DFA & NFA equivalence in Theory of Computation

10yr ⋅

⋅

A DFA for recognizing comments

13yr ⋅

⋅

What's the point of Subnet Masks?

10yr ⋅

⋅

Partition area using test function

10yr ⋅

⋅

Can not follow the example for max-flow-min-cut on Wikipedia

10yr ⋅

⋅

Why does packet data don't need trailer/footer while frame needs it?

10yr ⋅

⋅

Showing that deciding whether a given TM accepts a word of length 5 is undecidable

10yr ⋅

⋅

Why are the two farthest points vertices of the Convex Hull?

10yr ⋅

⋅

ADVERTISEMENT

Reconstruct directed graph from list of ancestors for each node

10yr ⋅

⋅

Mathmatical way to represent an image kernel?

12yr ⋅

⋅

When two siblings in a heap are equal, how do you bubble down?

12yr ⋅

⋅

Why should leaf nodes in a red-black tree be black?

10yr ⋅

⋅

Poker with Bluffing (game theory)

12yr ⋅

⋅

Correctness of the greedy algorithm

9yr ⋅

⋅

Log-Space Reduction $CO-2Col \\le_L USTCON$

10yr ⋅

⋅

Similarity between two geometric shapes

10yr ⋅

⋅

Difference between pattern matching and pattern searching in terms of DFA/Regex

12yr ⋅

⋅

Controlled NOT gate a type of measurement?

12yr ⋅

⋅

What is the type theory judgement symbol?

12yr ⋅

⋅

DFA to regular expression conversion

12yr ⋅

⋅

How to find whether a point is in a line or not

11yr ⋅

⋅

ADVERTISEMENT

How to find $L_q = \\emptyset$, a state that is not reachable for any given string?

12yr ⋅

⋅

Why is the Shannon entropy 0.94 in this example?

12yr ⋅

⋅

Slow MIS Distributed Algorithm

12yr ⋅

⋅

What is postorder traversal on this simple tree?

12yr ⋅

⋅

detect closed shapes formed by points

11yr ⋅

⋅

Can Real-Time Strategy games be ever solved?

12yr ⋅

⋅

What is the order of the Pancake graph in Given example & what are the properties of Pancake graph?

11yr ⋅

⋅

How to count near circular objects in image

11yr ⋅

⋅

Finding squares touching points

11yr ⋅

⋅

Language where every prefix has almost equal a's and b's

11yr ⋅

⋅

Regular expression for words in a language where each letter appears at least once

9yr ⋅

⋅

What do these arrows in design pattern diagrams mean?

12yr ⋅

⋅

Confusion about finite automata construction in Knuth–Morris–Pratt algorithm

11yr ⋅

⋅

ADVERTISEMENT

Average number of comparisons to locate item in BST

12yr ⋅

⋅

Could I simulate the implementation of memory components

12yr ⋅

⋅

Deriving the exact number of execution times

11yr ⋅

⋅

Banker's Algorithm and deadlocks

12yr ⋅

⋅

How does insertion work in an AVL tree?

11yr ⋅

⋅

Minimum cost closed walk in a graph

11yr ⋅

⋅

Confusion related to time complexity of dynamic programming algorithm for knapsack problem

11yr ⋅

⋅

How to evaluate the clock cycle for MIPS single cycle CPU

11yr ⋅

⋅

Calculating the number of unique BST generatable from n keys, why is my number so large

10yr ⋅

⋅

What's the regex corresponding to this DFA?

12yr ⋅

⋅

Understanding $\\text{handle}$ in parsing problem

13yr ⋅

⋅

Clarification with Kuhn-Munkres/Hungarian Algorithm

12yr ⋅

⋅

Using Clique decision to solve Clique optimization

12yr ⋅

⋅

ADVERTISEMENT

Simplification of regular expression and conversion into finite automata

12yr ⋅

⋅

Modification of Hamilton Path

12yr ⋅

⋅

LTS of this simple FSP

12yr ⋅

⋅

Automata that recognizes Kleene closure of permutations of three symbols

12yr ⋅

⋅

Deadlock and cycle in a resource allocation graph

11yr ⋅

⋅

Equality testing of arrays and integers in a procedural language

12yr ⋅

⋅

Graph Bipartiteness

12yr ⋅

⋅

Why isn't converting from an NFA to a DFA working?

12yr ⋅

⋅

Given two heuristic values how do I tell which one is admissible?

10yr ⋅

⋅

How to interpret plot of cost function in gradient descend algorithm?

7yr ⋅

⋅

Convert RE to DFA

9yr ⋅

⋅

What will be the time complexity for the following search algorithm in a graph?

7yr ⋅

⋅