User mhum

23 votes

Accepted

Algorithms computing if a number is a multiple of 3

answered Jan 11, 2013 at 2:57

12 votes

Which Turing Award winners have supervised the PhDs of other Turing Award winners?

answered Mar 15, 2022 at 2:20

10 votes

Accepted

What is the origin of dot notation?

answered Mar 7, 2018 at 23:45

10 votes

Accepted

Algorithm to match numbers with minimum number of moves

answered May 7, 2014 at 0:52

10 votes

Data Science vs Operations Research

answered Mar 17, 2017 at 21:51

7 votes

Accepted

What is the correct representation of Master Theorem?

answered Dec 20, 2014 at 0:02

6 votes

Accepted

Does the Bible solve an NP-hard problem?

answered Jun 28, 2014 at 1:21

6 votes

Accepted

Uniformly Random Nested Subset Pairs

answered Jun 27, 2017 at 1:46

5 votes

Accepted

Transforming an arbitrary cover into a vertex cover

answered Apr 19, 2013 at 21:28

5 votes

An $\mathbb F$-algebra as input to an algorithm

answered Jul 8, 2012 at 10:07

4 votes

Algorithm to compose identity from a set of permutations

answered May 30, 2015 at 1:44

4 votes

Sum of all products of subarrays

answered Jan 1, 2016 at 1:00

4 votes

Accepted

Sensitivity and Block sensitivity

answered Dec 3, 2014 at 20:31

4 votes

What is the name of the theory that says that Turing equivalence is universal, and Turing machines are maximally computationally powerful?

answered Mar 15 at 21:54

3 votes

Accepted

File format for SAT competitions

answered Jun 24 at 21:03

3 votes

Why is binary search called binary search?

answered May 28, 2015 at 2:38

3 votes

Accepted

What is the right term/theory for prediction of Binary Variables based upon their continuous value?

answered Dec 6, 2018 at 21:31

3 votes

Prove count without revealing data

answered Mar 15, 2017 at 20:24

3 votes

Accepted

Is this possible to solve SAT in polynomial time by reducing it to the problem of solving system of nonlinear equations?

answered Jul 27, 2017 at 2:06

3 votes

Is there a mathematical way to deduce that my directed graph is disconnected?

answered Jan 10, 2014 at 3:30

2 votes

Computing with the Monster

answered Oct 30, 2013 at 2:13

2 votes

Is finding the smallest collection of subsets so that the number of elements among the subsets is <= the number of subsets NP-hard?

answered Dec 25, 2014 at 1:10

2 votes

Accepted

Are there some real-world optimization problems with very cheap objective functions?

answered Jan 8, 2015 at 19:13

2 votes

Find a minimum-cardinality Hall-violator

answered Feb 4, 2019 at 18:48

2 votes

Accepted

Is maximum edge-weighted triangle-free graph NP-hard?

answered Feb 6, 2019 at 17:39

2 votes

What's the correct term for this analog of cryptography?

answered Mar 14, 2018 at 0:45

2 votes

Fast sampling from discrete space

answered Aug 11, 2018 at 0:46

2 votes

Understanding N process Peterson's algorithm

answered Oct 24, 2018 at 14:22

2 votes

Accepted

Making a profit as a high-dimensional store owner?

answered Nov 9, 2018 at 20:48

2 votes

Natural combinatorial property in Natural Proofs

answered Dec 22, 2023 at 19:25

Stack Exchange Network

39 Answers

Algorithms computing if a number is a multiple of 3

Which Turing Award winners have supervised the PhDs of other Turing Award winners?

What is the origin of dot notation?

Algorithm to match numbers with minimum number of moves

Data Science vs Operations Research

What is the correct representation of Master Theorem?

Does the Bible solve an NP-hard problem?

Uniformly Random Nested Subset Pairs

Transforming an arbitrary cover into a vertex cover

An $\mathbb F$-algebra as input to an algorithm

Algorithm to compose identity from a set of permutations

Sum of all products of subarrays

Sensitivity and Block sensitivity

What is the name of the theory that says that Turing equivalence is universal, and Turing machines are maximally computationally powerful?

File format for SAT competitions

Why is binary search called binary search?

What is the right term/theory for prediction of Binary Variables based upon their continuous value?

Prove count without revealing data

Is this possible to solve SAT in polynomial time by reducing it to the problem of solving system of nonlinear equations?

Is there a mathematical way to deduce that my directed graph is disconnected?

Computing with the Monster

Is finding the smallest collection of subsets so that the number of elements among the subsets is <= the number of subsets NP-hard?

Are there some real-world optimization problems with very cheap objective functions?

Find a minimum-cardinality Hall-violator

Is maximum edge-weighted triangle-free graph NP-hard?

What's the correct term for this analog of cryptography?

Fast sampling from discrete space

Understanding N process Peterson's algorithm

Making a profit as a high-dimensional store owner?

Natural combinatorial property in Natural Proofs