Hello,

I’m afraid you won’t be able to contact Vladimir Fedorovich, he passed away in January 2016.

Should you have any questions about the paper you can forward them to me directly and I will try to help with what I can.

dmitry.gusev at gmail dot com

]]>Hello! Do you know any other way to contact Romanov? I have couple questions about this paper, but nobody answers from this email.

]]>As far as I know the description isn’t completely sufficient — there’s no detailed step-by-step description of the algorithm and every subroutine that needs to be implemented. It requires that a reader knows some basic concepts.

I haven’t read english version of the article, but I suspect you’re talking about http://en.wikipedia.org/wiki/Constraint_satisfaction_problem

You can find some references to this by following this 2-SAT article:

http://en.wikipedia.org/wiki/2-satisfiability

Tesseractic:

There’s no reference implementation (yet?), at least not the one I know of. I also don’t know if professor Romanov has any implementation available. I suggest you to contact him directly at romvf@mail.ru.

I haven’t made any progress on new implementation, and I won’t have any time soon to work on it.

]]>Also, is the paper’s description of the algorithm completely sufficient, or does it require, for instance, knowledge of ‘constraints distribution’?

Is there an alternative reference for ‘constraints distribution’, preferably on the net?

]]>Dmitry: have you made any progress on a reference implementation?

]]>Rows for F2 also taken from F, but the permutation of variables changed for F2.

You can look at the previous reference implementation, F => CTF set completely implemented there. Try running any example using this solver, and examine debug output.

]]>I can’t give you an exact estimates, because I’m working on this in my spare time, which I don’t have a lot this time.

Current implementation should be much simpler than previous: there is no more hyperstructures and concordant shifts, etc. So if someone else wants to try his skills and implement this — you’re welcome, I will try to answer any questions with the help of Vladimir Romanov.

Meanwhile you can watch this repo on github: https://github.com/anjlab/sat3. If new implementation will appear from me — it will be there. Of course, I will also write a post here when it will be ready.

]]>When can we expect a reference implementation to be available?

]]>