![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Andrei A. Krokhin 8 Andrei A. Krokhin, Andrei A. Bulatov , Peter Jeavons : Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. ISMVL 2003 : 343- 7 Andrei A. Krokhin, Benoit Larose : Solving Order Constraints in Logarithmic Space. STACS 2003 : 379-390 6 Andrei A. Krokhin, Peter Jeavons , Peter Jonsson : The Complexity of Constraints on Intervals and Lengths. STACS 2002 : 443-454 5 Andrei A. Krokhin, Peter Jonsson : Extending the Point Algebra into the Qualitative Algebra. TIME 2002 : 28-35 4 Andrei A. Krokhin, Peter Jeavons , Peter Jonsson : A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation. IJCAI 2001 : 83-88 3 Andrei A. Bulatov , Andrei A. Krokhin, Peter Jeavons : The complexity of maximal constraint languages. STOC 2001 : 667-674 2 Andrei A. Krokhin, Peter Jeavons , Peter Jonsson : The complexity of constraints on intervals and lengths. Electronic Colloquium on Computational Complexity (ECCC) (077): (2001) 1 Andrei A. Bulatov , Andrei A. Krokhin, Peter Jeavons : Constraint Satisfaction Problems and Finite Algebras. ICALP 2000 : 272-282 ![]() DiSC'03 © 2003 Association for Computing Machinery |