Revision as of 19:50, 18 April 2007 edit 141.162.101.50 (talk) →Another question about time complexity ← Previous edit		Revision as of 19:51, 18 April 2007 edit undo 141.162.101.50 (talk) →Another question about time complexity Next edit →
Line 106: Are these two quotes not contradictory? [[User:Oli Filth\|Oli Filth]] 18:26, 17 April 2007 (UTC) : Polynomial in the size of the input, which is log N bits (because you need that many to input N) --[[User:141.162.101.50\|141.162.101.50]] 19:51, 18 April 2007 (UTC)

Talk:Shor's algorithm: Difference between revisions