Author:
Engebretsen Lars,Holmerin Jonas,Russell Alexander
Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. The Probabilistic Method;Alon,2000
2. Proof verification and the hardness of approximation problems;Arora;J. ACM,1998
3. D.A.M. Barrington, P. McKenzie, C. Moore, P. Tesson, D. Thérien, Equation satisfiability and program satisfiability for finite monoids, in: Proc. 25th Annu. Symp. on Mathematical Foundations of Computer Science, Bratislava, Slovak Republic, 2000, pp. 172–181.
4. Non-uniform automata over groups;Barrington;Inform. Comput.,1990
5. Finite monoids and the fine structure of NC1;Barrington;J. ACM,1988
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs;Algorithmica;2023-03-27
2. Optimal inapproximability of satisfiable k-LIN over non-abelian groups;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
3. A characterization of strong approximation resistance;Proceedings of the forty-sixth annual ACM symposium on Theory of computing;2014-05-31
4. Equivariant Unification;Journal of Automated Reasoning;2009-12-22
5. Hard constraint satisfaction problems have hard gaps at location 1;Theoretical Computer Science;2009-09