Wellcome to Sergey Kirgizov's library,

  You can find here all papers liked or uploaded by Sergey Kirgizov
  together with brief user bio and description of her/his academic activity.


Browse to my personsal site http://kirgizov.link if you wish so.

Comments:

Apparently, a single 'mov' assembler instruction is already Turing complete. Implementation of mov-only compilator is [available](https://github.com/xoreaxeaxeax/movfuscator/blob/master/README.md). > The M/o/Vfuscator (short 'o', sounds like "mobfuscator") compiles programs into "mov" instructions, and only "mov" instructions. Arithmetic, comparisons, jumps, function calls, and everything else a program needs are all performed through mov operations; there is no self-modifying code, no transport-triggered calculation, and no other form of non-mov cheating.
Read the paper, add your comments…

Comments:

Although certain NP-complete problems stay hard even on average input, some NP-complete problems are only hard in rare cases. Such NP-complete problems can provably be resolved very quickly on average case under some probability distributions over all possible inputs. **1. What is the average case of a real-world graph ? ** **2. How to properly define a suitable probability distribution for real-world graphs ? **
Read the paper, add your comments…

Comments:

Continuing the series of articles (... well actually is just the second one) on restricted combinatorial objects constrained by a recursively defined statistic and initiated by [this work](https://papers-gamma.link/paper/38/Dyck%20paths%20with%20a%20first%20return%20decomposition%20constrained%20by%20height) we submitted to review a new paper of subject.
Il y a Lukasuewicz à faire maintenant ... 😀
Read the paper, add your comments…
Pages: 1 2 3 4 5 6 7 8