Inapproximability results for equations over finite groups

[1]  Alexander Russell,et al.  Necessary and sufficient conditions for collision-free hashing , 1992, Journal of Cryptology.

[2]  Alexander Russell,et al.  A note on the set systems used for broadcast encryption , 2003, SODA '03.

[3]  Alexander Russell,et al.  The Complexity of Synchronous Iterative Do-All with Crashes , 2001, DISC.

[4]  Alexander Russell,et al.  The Hidden Subgroup Problem and Quantum Computation Using Group Representations , 2003, SIAM J. Comput..

[5]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[6]  A. Russell,et al.  Quantum Walks on the Hypercube , 2001, RANDOM.

[7]  Alexander Russell,et al.  A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics , 2002, NIPS.

[8]  Jonas Holmerin,et al.  Towards optimal lower bounds for clique and chromatic number , 2003, Theor. Comput. Sci..

[9]  Alexander Russell,et al.  Perfect Information Leader Election in log* n+O (1) Rounds , 2001, J. Comput. Syst. Sci..

[10]  Subhash Khot,et al.  Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[11]  Alexander Russell,et al.  Local scheduling for distributed cooperation , 2001, Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001.

[12]  Lars Engebretsen.  The Non-approximability of Non-Boolean Predicates , 2001, RANDOM-APPROX.

[13]  Alexander Russell,et al.  Optimal scheduling for disconnected cooperation , 2001, PODC '01.

[14]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[15]  Venkatesan Guruswami,et al.  Hardness of approximate hypergraph coloring , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[16]  P. Rowlinson.  FOURIER ANALYSIS ON FINITE GROUPS AND APPLICATIONS (London Mathematical Society Student Texts 43) , 2000 .

[17]  Cristopher Moore,et al.  Equation Satisfiability and Program Satisfiability for Finite Monoids , 2000, MFCS.

[18]  Alexander Russell,et al.  Distributed cooperation in the absence of communication (brief announcement) , 2000, PODC '00.

[19]  Jonas Holmerin,et al.  Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.

[20]  Alexander Russell,et al.  Normal subgroup reconstruction and quantum computation using group representations , 2000, STOC '00.

[21]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

[22]  Alexander Russell,et al.  Spectral Bounds on General Hard Core Predicates , 2000, STACS.

[23]  Alexander Russell,et al.  The Complexity of Distributed Cooperation in the Presence of Failures , 2000, OPODIS.

[24]  Alexander Russell,et al.  The complexity of solving equations over finite groups , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[25]  Michael E. Saks,et al.  Lower bounds for leader election and collective coin-flipping in the perfect information model , 1999, STOC '99.

[26]  Alexander Russell,et al.  Approximating Latin Square Extensions , 1996, Algorithmica.

[27]  A. Terras.  Fourier Analysis on Finite Groups and Applications: Index , 1999 .

[28]  U. Feige.  A threshold of ln n for approximating set cover , 1998, JACM.

[29]  A. Russell,et al.  Extraction of optimally unbiased bits from a biased source , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[30]  Uri Zwick,et al.  Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.

[31]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[32]  Alexander Russell,et al.  Faster algorithms for optical switch configuration , 1997, Proceedings of ICC'97 - International Conference on Communications.

[33]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[34]  J. Håstad.  Clique is hard to approximate within n 1-C , 1996 .

[35]  S P Strunkov.  On the theory of equations in finite groups , 1995 .

[36]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[37]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[38]  Carsten Lund,et al.  Alternation in interaction , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[39]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[40]  Alain Goupil,et al.  The Poset of Conjugacy Classes and Decomposition of Products in the Symmetric Group , 1992, Canadian Mathematical Bulletin.

[41]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[42]  Denis Thérien,et al.  Non-Uniform Automata Over Groups , 1987, Inf. Comput..

[43]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[44]  D. M. Barrington,et al.  Finite monoids and the fine structure of NC1 , 1988, JACM.

[45]  Denis Thérien,et al.  Finite monoids and the fine structure of NC1 , 1987, STOC.

[46]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[47]  K. I. Mandelberg,et al.  On Solutions of "Equations in Symmetric Groups" , 1978, J. Comb. Theory, Ser. A.