The following pages link to Andrei A. Krokhin (Q221508):
Displayed 16 items.
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Algebraic approach to promise constraint satisfaction (Q5212802) (← links)
- Oracle Tractability of Skew Bisubmodular Functions (Q5246086) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- Computer Science Logic (Q5292625) (← links)
- STACS 2004 (Q5309696) (← links)
- Classifying the Complexity of Constraints Using Finite Algebras (Q5317171) (← links)
- Towards a Characterization of Constant-Factor Approximable Min CSPs (Q5362995) (← links)
- The Approximability of Three-valued MAX CSP (Q5470737) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- (Q5715675) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897200) (← links)
- Congruences of clone lattices. II (Q5951888) (← links)
- Topology and adjunction in promise constraint satisfaction (Q6337399) (← links)
- An invitation to the promise constraint satisfaction problem (Q6409116) (← links)