Home

Dr. Igor Razgon's homepage (mobile version)

Preprints

  1. O. Lachish, I. Razgon "Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs".
  2. A. Atminas, V. Lozin, I.Razgon "Well-quasi-ordering, tree-width and subquadratic properties of graphs".
  3. I. Razgon "On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth".
  4. I. Razgon "Two types of branching programs with bounded repetition that cannot efficiently compute monotone 3-CNFs".