User Joe Fitzsimons

38 votes

Accepted

"The Solution Problem" - How to get credit for your work as an undergrad?

answered Apr 14, 2011 at 0:25

35 votes

Major unsolved problems in theoretical computer science?

answered Aug 17, 2010 at 21:00

30 votes

What would be the consequences of factoring being NP-complete?

answered Aug 17, 2010 at 16:39

30 votes

Advice on good research practices

answered Nov 13, 2010 at 19:45

27 votes

Algorithms from the Book

answered Aug 27, 2010 at 14:57

25 votes

What is the Volume of Information?

answered Sep 23, 2010 at 11:49

21 votes

Accepted

Universities for Quantum Computing / Information?

answered Oct 26, 2010 at 23:56

21 votes

Accepted

Where does the information in a fractal come from?

answered Nov 16, 2010 at 13:22

21 votes

Accepted

Consequences of $SAT \in BQP$

answered Apr 18, 2011 at 13:35

21 votes

Is the integer factorization problem harder than RSA factorization: $n = pq$?

answered May 25, 2011 at 15:15

19 votes

A lottery that you can be convinced that it is fair

answered Jun 15, 2012 at 18:32

18 votes

Accepted

Are there any known implementations for quantum computing constructs?

answered Aug 17, 2010 at 3:34

17 votes

Accepted

How much computational power fits into a cubic centimeter?

answered Nov 7, 2010 at 5:32

16 votes

Which is the limit of lossless compression data? (if there exists such a limit)

answered Jun 17, 2011 at 17:29

16 votes

Problems Between P and NPC

answered Aug 17, 2010 at 3:16

15 votes

What are the consequences of Parity-L = P?

answered Aug 17, 2010 at 17:53

15 votes

Is there an equivalent to derandomization for quantum algorithms?

answered Aug 24, 2010 at 2:45

15 votes

Is Magic: the Gathering Turing complete?

answered Oct 9, 2010 at 15:01

15 votes

Does cryptography have an inherent thermodynamic cost?

answered May 13, 2011 at 23:30

15 votes

What are the consequences of $L = \oplus L$?

answered Nov 16, 2011 at 16:27

14 votes

What is the computational complexity of "solving" chess?

answered May 13, 2011 at 23:13

14 votes

How close can we get to linear multiply, add, and compare (on integers)?

answered Nov 15, 2012 at 14:15

14 votes

P vs. NP and Pseudorandom Bit Generators

answered Nov 10, 2010 at 8:02

14 votes

Quantum matrix multiplication?

answered Nov 13, 2010 at 15:21

13 votes

Natural computation based on fundamental forces

answered Feb 13, 2011 at 16:33

13 votes

DNA-algorithms and NP-completeness

answered Nov 4, 2010 at 11:02

13 votes

Accepted

Universal sets of gates for SU(3)?

answered Jan 17, 2012 at 9:00

12 votes

What is the smallest result you publish on ArXiv?

answered Aug 1, 2011 at 14:52

12 votes

Accepted

Transitioning from quantum to classical random walks on the line

answered Aug 5, 2011 at 8:23

12 votes

What videos should everybody watch?

answered Oct 19, 2010 at 15:56

Stack Exchange Network

105 Answers

"The Solution Problem" - How to get credit for your work as an undergrad?

Major unsolved problems in theoretical computer science?

What would be the consequences of factoring being NP-complete?

Advice on good research practices

Algorithms from the Book

What is the Volume of Information?

Universities for Quantum Computing / Information?

Where does the information in a fractal come from?

Consequences of $SAT \in BQP$

Is the integer factorization problem harder than RSA factorization: $n = pq$?

A lottery that you can be convinced that it is fair

Are there any known implementations for quantum computing constructs?

How much computational power fits into a cubic centimeter?

Which is the limit of lossless compression data? (if there exists such a limit)

Problems Between P and NPC

What are the consequences of Parity-L = P?

Is there an equivalent to derandomization for quantum algorithms?

Is Magic: the Gathering Turing complete?

Does cryptography have an inherent thermodynamic cost?

What are the consequences of $L = \oplus L$?

What is the computational complexity of "solving" chess?

How close can we get to linear multiply, add, and compare (on integers)?

P vs. NP and Pseudorandom Bit Generators

Quantum matrix multiplication?

Natural computation based on fundamental forces

DNA-algorithms and NP-completeness

Universal sets of gates for SU(3)?

What is the smallest result you publish on ArXiv?

Transitioning from quantum to classical random walks on the line

What videos should everybody watch?