InformedA's user avatar
InformedA's user avatar
InformedA's user avatar
InformedA
  • Member for 9 years, 7 months
  • Last seen more than 1 year ago
13 votes
Accepted

Proving that the average case complexity of binary search is O(log n)

6 votes

Determine whether a point lies in a convex hull of points in O(logn)

5 votes

How again do certain sorting methods use $o(n \log n)$ time?

4 votes
Accepted

Fixed size set to contain the maximum number of given sets

3 votes

Explanation of Summations for Algorithm Analysis

2 votes
Accepted

NP-hardness of an optimization problem with real value

2 votes

Are constituency grammars and dependency grammars two different types of context free grammars?

2 votes

Word tiling, where you must use each tile exactly once

2 votes

Understanding transactions

1 vote

Simulate a fair die with a biased die

1 vote

Cutting equal sticks from different sticks

1 vote

Understanding A* Search on Tropical Island

1 vote

Is $AlwaysHalt$ recursively enumerable?

1 vote

Application of cosine similarity to detect plagiarism

1 vote
Accepted

How does the Earley Parser store possible parses of an ambiguous sentence?

1 vote

Rigorous Proof of Insertion Sort

1 vote
Accepted

How to write CFG for languages

1 vote

Is there a physical analogy to the Turing Machine?

0 votes

How can I keep track of the state of a sequence after rotating parts of it multiple times?

0 votes

Show that finding a minimum-weight subgraph that includes all marked nodes is NP-hard

0 votes

Guessing Number Game

0 votes

Calculating speedup for a two-way superscalar cpu

0 votes

Is there a way to find path length to a node from root in a binary tree?

-1 votes

Algorithm for finding best combination of elements