All Stories

  1. Proof of Parallels on Computational Problem Resolution
  2. Proof of Parallels on Computational Problem Resolution
  3. Proof of Parallels on Computational Problem Resolution
  4. Almost Polynomial Matching with Extended Regular Expressions
  5. Almost Polynomial Matching with Extended Regular Expressions
  6. Almost Polynomial Matching with Extended Regular Expressions
  7. On Equivalence of Tractable and Non-polynomial Classes of Complexity
  8. On Equivalence of Tractable and Non-polynomial Classes of Complexity
  9. On Equivalence of Tractable and Non-polynomial Classes of Complexity
  10. Artificial Intelligence as a Delegate or Helper
  11. NP-complete Problems can be Solved and Verified in Polynomial Time
  12. On Equivalence of Tractable and Non-polynomial Classes of Complexity
  13. On Experimental Proof of "P versus NP" Theorem
  14. On the Role of Court Interpreter
  15. Deterministic automata for extended regular expressions
  16. Methodology to Produce Deterministic Automaton for Extended Operators in Regular Expression
  17. The algorithm to Generate DFA for AND-operator in Regular Expression
  18. Ant Colony Optimisation Applied to Non-Slicing Floorplanning