The following pages link to Andrei A. Krokhin (Q221508):
Displaying 50 items.
- (Q693059) (redirect page) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- Complexity classification in qualitative temporal constraint reasoning (Q814637) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- A note on supermodular sublattices in finite relatively complemented lattices (Q998786) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Characterizations of several Maltsev conditions. (Q2351504) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Majority constraints have bounded pathwidth duality (Q2427535) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Complexity of clausal constraints over chains (Q2480746) (← links)
- Retractions onto series-parallel posets (Q2483392) (← links)
- (Q2754150) (← links)
- On algebras with many symmetric operations (Q2821826) (← links)
- Robust Satisfiability for CSPs (Q2947586) (← links)
- Retractions to Pseudoforests (Q3084215) (← links)
- Two new homomorphism dualities and lattice operations (Q3103979) (← links)
- (Q3113761) (← links)
- (Q3150805) (← links)
- On the hardness of losing weight (Q3189060) (← links)
- (Q3365840) (← links)
- First-order Definable Retraction Problems for Posets and Reflexive Graphs (Q3437257) (← links)
- The approximability of MAX CSP with fixed-value constraints (Q3451267) (← links)
- Reasoning about temporal relations (Q3452504) (← links)
- Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems (Q3499775) (← links)
- (Q3505128) (← links)
- On the Hardness of Losing Weight (Q3521957) (← links)
- Maximum Constraint Satisfaction on Diamonds (Q3524191) (← links)
- (Q3576659) (← links)
- Tree Dualities for Constraint Satisfaction (Q3586031) (← links)
- Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction (Q3614209) (← links)
- (Q4263742) (← links)
- On the structure of the lattice of closed classes of polynomials (Q4367625) (← links)
- (Q4418666) (← links)
- (Q4544372) (← links)
- Robust algorithms with polynomial loss for near-unanimity CSPs (Q4575759) (← links)
- Constraint Satisfaction Problems on Intervals and Lengths (Q4652603) (← links)
- (Q4736861) (← links)
- (Q4763272) (← links)
- (Q4793059) (← links)
- (Q4967163) (← links)
- (Q4993594) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Algebraic Approach to Promise Constraint Satisfaction (Q5056418) (← links)
- The complexity of maximal constraint languages (Q5176025) (← links)
