User contributions for Daniel.porumbel
A user with 74 edits. Account created on 17 April 2017.
21 September 2017
29 August 2017
- 17:1317:13, 29 August 2017 diff hist +78 Talk:Gaussian elimination →On the exponential bit string complexity?
- 17:1217:12, 29 August 2017 diff hist +27 Talk:Gaussian elimination →On the exponential bit string complexity?
- 17:1217:12, 29 August 2017 diff hist +185 Talk:Gaussian elimination →On the exponential bit string complexity?
- 17:0117:01, 29 August 2017 diff hist +1,102 Talk:Time complexity →I do not agree that the Euclidean algorithm uses O((\log\ a + \log\ b)^2) steps on the Turing machine
30 July 2017
- 10:4310:43, 30 July 2017 diff hist +1,095 Talk:Time complexity →Conclusion
29 July 2017
- 13:0113:01, 29 July 2017 diff hist +6 Talk:Time complexity →Conclusion
- 12:3412:34, 29 July 2017 diff hist −2 Talk:Time complexity →Conclusion
- 12:3012:30, 29 July 2017 diff hist +1,300 Talk:Time complexity →Conclusion
28 July 2017
- 22:1922:19, 28 July 2017 diff hist +103 Talk:Time complexity →Conclusion
- 22:1722:17, 28 July 2017 diff hist +89 Talk:Time complexity →Conclusion
- 22:1322:13, 28 July 2017 diff hist +2,841 Talk:Time complexity →Conclusion
- 15:3415:34, 28 July 2017 diff hist +1,124 Talk:Time complexity →I do not agree that the Euclidean algorithm uses O((\log\ a + \log\ b)^2) steps on the Turing machine
- 12:4712:47, 28 July 2017 diff hist 0 User talk:David Eppstein →Reporting polynomial complexities
- 12:4712:47, 28 July 2017 diff hist +1,278 User talk:David Eppstein →Reporting polynomial complexities: new section
- 12:1112:11, 28 July 2017 diff hist +1,538 Talk:Time complexity →I do not agree that the Euclidean algorithm uses O((\log\ a + \log\ b)^2) steps on the Turing machine
27 July 2017
- 18:5718:57, 27 July 2017 diff hist +7 Talk:Time complexity →Conclusion
- 18:5618:56, 27 July 2017 diff hist +55 Talk:Time complexity →Conclusion
- 18:5018:50, 27 July 2017 diff hist +1,407 Talk:Gaussian elimination →On the exponential bit string complexity?: new section
23 July 2017
- 19:3919:39, 23 July 2017 diff hist 0 Talk:Time complexity →Conclusion
- 19:3919:39, 23 July 2017 diff hist +13 Talk:Time complexity →Conclusion
- 19:3719:37, 23 July 2017 diff hist +46 Talk:Time complexity →Conclusion
- 14:4814:48, 23 July 2017 diff hist +6 Talk:Time complexity →Conclusion
- 14:4714:47, 23 July 2017 diff hist −5 Talk:Time complexity →Conclusion
- 14:4614:46, 23 July 2017 diff hist +52 Talk:Time complexity →Conclusion
- 14:4314:43, 23 July 2017 diff hist +6 Talk:Time complexity →Conclusion
- 14:4114:41, 23 July 2017 diff hist −7 Talk:Time complexity →Conclusion
- 14:4014:40, 23 July 2017 diff hist +746 Talk:Time complexity →Conclusion
- 14:2314:23, 23 July 2017 diff hist +1 Talk:Time complexity →Conclusion
- 14:2214:22, 23 July 2017 diff hist +8 Talk:Time complexity →Conclusion
- 14:2114:21, 23 July 2017 diff hist +49 Talk:Time complexity →Conclusion
- 13:2013:20, 23 July 2017 diff hist +8 Talk:Time complexity →Conclusion
- 13:1913:19, 23 July 2017 diff hist +1,283 Talk:Time complexity →What does exactly mean O((\log\ a + \log\ b)^2) Turing machine steps for the Euclidean algorithm?
21 July 2017
- 21:3821:38, 21 July 2017 diff hist +2 Talk:Time complexity →What does exactly mean O((\log\ a + \log\ b)^2) Turing machine steps for the Euclidean algorithm?
20 July 2017
- 19:4519:45, 20 July 2017 diff hist −1,354 Talk:Linear programming No edit summary
- 16:2916:29, 20 July 2017 diff hist −15 Talk:Time complexity →What does exactly mean O((\log\ a + \log\ b)^2) Turing machine steps for the Euclidean algorithm?
- 16:2816:28, 20 July 2017 diff hist +12 Talk:Time complexity →What does exactly mean O((\log\ a + \log\ b)^2) Turing machine steps for the Euclidean algorithm?
- 14:2714:27, 20 July 2017 diff hist +13 Talk:Karush–Kuhn–Tucker conditions →Problem in the Mangasarian-Fromovitz constraint qualification conditions?
- 14:0814:08, 20 July 2017 diff hist +1,303 Talk:Karush–Kuhn–Tucker conditions →Problem in the Mangasarian-Fromovitz constraint qualification conditions?
- 12:4412:44, 20 July 2017 diff hist +1,553 Talk:Time complexity →What does exactly mean O((\log\ a + \log\ b)^2) Turing machine steps for the Euclidean algorithm?
19 July 2017
- 15:4515:45, 19 July 2017 diff hist +104 Talk:Time complexity →What does exactly mean O((\log\ a + \log\ b)^2) Turing machine steps for the Euclidean algorithm?
- 15:4515:45, 19 July 2017 diff hist +49 Talk:Time complexity →What does exactly mean O((\log\ a + \log\ b)^2) Turing machine steps for the Euclidean algorithm?
- 15:4215:42, 19 July 2017 diff hist +422 Talk:Linear programming →About the open problem of the strongly polynomial algorithm for linear programming?
- 15:3315:33, 19 July 2017 diff hist +7 Talk:Linear programming →About the open problem of the strongly polynomial algorithm for linear programming?
- 15:3315:33, 19 July 2017 diff hist +25 Talk:Linear programming →About the open problem of the strongly polynomial algorithm for linear programming?
- 13:5613:56, 19 July 2017 diff hist +104 Talk:Linear programming →About the open problem of the strongly polynomial algorithm for linear programming?
- 13:5613:56, 19 July 2017 diff hist +796 Talk:Linear programming →About the open problem of the strongly polynomial algorithm for linear programming?: new section
- 13:3513:35, 19 July 2017 diff hist +4 Talk:Time complexity →What does exactly mean O((\log\ a + \log\ b)^2) Turing machine steps for the Euclidean algorithm?
- 13:3413:34, 19 July 2017 diff hist +58 Talk:Time complexity →What does exactly mean O((\log\ a + \log\ b)^2) Turing machine steps for the Euclidean algorithm?
- 13:2913:29, 19 July 2017 diff hist +118 Talk:Karush–Kuhn–Tucker conditions →Problem in the Mangasarian-Fromovitz constraint qualification conditions?
