User 3yakuya

0 votes

Can Quantum Computing solve Problems not even a Turing Machine can solve?

answered Jun 3, 2016 at 11:59

2 votes

Supercomputer Configuration

answered May 13, 2016 at 13:01

4 votes

When did polynomial-time algorithm become of interest?

answered Jun 19, 2015 at 1:02

2 votes

np-complete proof, turing reduction

answered Apr 8, 2015 at 11:35

0 votes

Multi-qubit gates matrix representation

answered Jan 27, 2015 at 23:44

0 votes

"For small values of n, O(n) can be treated as if it's O(1)"

answered Dec 22, 2014 at 13:20

1 vote

What happened if we implement quicksort without tail recursion?

answered Dec 22, 2014 at 12:31

2 votes

Is order of bits in byte really not of concern?

answered Dec 17, 2014 at 23:42

1 vote

Accepted

Understanding Instruction Cycle?

answered Dec 17, 2014 at 23:28

3 votes

Accepted

Measure two qubits, one from entangled pair, in Bell basis?

answered Dec 17, 2014 at 2:39

0 votes

Accepted

Given a Red-Black Tree of n keys, is there a way to quickly determine if a red-node exists?

answered Dec 16, 2014 at 21:26

1 vote

Accepted

LazyHeap data structure with $O(n)$ Insert, Delete, and Return operations

answered Dec 15, 2014 at 18:52

0 votes

Can someone provide a trivial example to the "reduction" procedure used to prove hardness?

answered Dec 15, 2014 at 9:17

0 votes

Accepted

Let $L_4$ $\subseteq$ {0,1}$^*$ be the set of all palindromes whose first character is 1. Give a context-free grammar for $L_4$

answered Dec 14, 2014 at 15:25

7 votes

Accepted

Does there exist $O(n)$ worst case sorting algorithm for sorting a list of integers?

answered Dec 12, 2014 at 23:02

1 vote

Bellman–Ford negative path meaning

answered Dec 11, 2014 at 22:34

9 votes

Accepted

How to apply a 1-qubit gate to a single qubit from an entangled pair?

answered Dec 9, 2014 at 22:24

Stack Exchange Network

17 Answers

Can Quantum Computing solve Problems not even a Turing Machine can solve?

Supercomputer Configuration

When did polynomial-time algorithm become of interest?

np-complete proof, turing reduction

Multi-qubit gates matrix representation

"For small values of n, O(n) can be treated as if it's O(1)"

What happened if we implement quicksort without tail recursion?

Is order of bits in byte really not of concern?

Understanding Instruction Cycle?

Measure two qubits, one from entangled pair, in Bell basis?

Given a Red-Black Tree of n keys, is there a way to quickly determine if a red-node exists?

LazyHeap data structure with $O(n)$ Insert, Delete, and Return operations

Can someone provide a trivial example to the "reduction" procedure used to prove hardness?

Let $L_4$ $\subseteq$ {0,1}$^*$ be the set of all palindromes whose first character is 1. Give a context-free grammar for $L_4$

Does there exist $O(n)$ worst case sorting algorithm for sorting a list of integers?

Bellman–Ford negative path meaning

How to apply a 1-qubit gate to a single qubit from an entangled pair?