Andrei A. Krokhin
SIAM journal on computing (Print) · 2005–2015
A researcher in the Science corpus: 2 papers; trusts 3 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Andrei A. Krokhin trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Andrei A. Krokhin overall
Papers from Andrei A. Krokhin's perspective
Ordered by how strongly the researchers Andrei A. Krokhin trusts endorse each paper. Same corpus, a different order for every researcher.
- Existence theorems for weakly symmetric operations
- A strong Mal’cev condition for locally finite varieties omitting the unary type
- Optimal strong Mal’cev conditions for omitting type 1 in locally finite varieties
- I Computational Complexity
- Complexity classifications of Boolean constraint satisfaction problems (SIAM monographs on discrete mathematics and applications)
- Universal Algebra: Fundamentals and Selected Topics
- Constraints
- The Shape of Congruence Lattices
- Varieties with few subalgebras of powers
- Algebraic structures in combinatorial problems
Their papers
- Characterizations of several Maltsev conditions (2015) — 81 citations
- Classifying the Complexity of Constraints Using Finite Algebras (2005) — 604 citations