My papers were rejected from a top conference venue in computer science due to laughably fallacious arguments. The reject decisions were based upon the following comments:
- The one's complement checksum of an all zero bit sequence is zero!
- O(n2) can be more efficient than O(n), because for n = 0.9, 0.92 < 0.9 !
What should I do now?
No comments:
Post a Comment