Computer Science

Theory of Computing

68Qxx

  1. M. D. Atkinson, The complexity of algorithms, Computing Tomorrow, Cambridge Univ. Press, Cambridge, 1996, pp. 1–20.[MR]
  2. László Babai and Robert Beals, A polynomial-time theory of black box groups. I, Groups St. Andrews 1997 in Bath, I, London Math. Soc. Lecture Note Ser., vol. 260, Cambridge Univ. Press, Cambridge, 1999, pp. 30–64.[MR]
  3. Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din, and Eric Schost, On the geometry of polar varieties, Appl. Algebra Engrg. Comm. Comput. 21 (2010), no. 1, 33–83.[MR/doi]
  4. Michael J. Beeson, The mechanization of mathematics, Alan Turing: Life and Legacy of a Great Thinker, Springer, Berlin, 2004, pp. 77–134.[MR]
  5. Wieb Bosma, John Cannon, and Catherine Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), no. 3-4, 235–265.[MR]
  6. Murat Cenk and Ferruh Özbudak, On multiplication in finite fields, J. Complexity 26 (2010), no. 2, 172–186.[doi]
  7. James H. Davenport, Abstract data types in computer algebra, Mathematical Foundations of Computer Science 2000 (Bratislava), Lecture Notes in Comput. Sci., vol. 1893, Springer, Berlin, 2000, pp. 21–35.[MR]
  8. C. Dominquez, J. Rubio, and F. Sergeraert, Modelling inheritance as coercion in the Kenzo system, Journal of Universal Computer Science 12 (2006), 1701–1730.
  9. Nicholas James Doye, Order sorted computer algebra and coercions, PhD Thesis, University of Bath, 1997.
  10. Gabriela Jeronimo, Teresa Krick, Juan Sabia, and Martín Sombra, The computational complexity of the Chow form, Found. Comput. Math. 4 (2004), no. 1, 41–117.[MR]
  11. William M. Kantor, Sylow's theorem in polynomial time, J. Comput. System Sci. 30 (1985), no. 3, 359–394.[MR]
  12. Andrei Kelarev, Graph algebras and automata, Monographs and Textbooks in Pure and Applied Mathematics, vol. 257, Marcel Dekker Inc., New York, 2003, pp. viii+366.[MR]
  13. Eugene M. Luks and Pierre McKenzie, Parallel algorithms for solvable permutation groups, J. Comput. System Sci. 37 (1988), no. 1, 39–62.[MR]
  14. Masayuki Noro, Modular dynamic evaluation, in ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 2006, pp. 262–268.[doi]
  15. I. I. Reznikov and V. I. Sushchanskii, A software system for growth analysis of Mealy automata, Cybernetics and Systems Analysis 42 (2006), no. 2, 265–276.[link]
  16. Fritz Schwarz, ALL TYPES: An algebraic language and type system, Artificial Intelligence and Symbolic Computation: International Conference AISC'98, Plattsburgh, New York, USA, September 1998. Proceedings, Lecture Notes in Computer Science, vol. 1476, Springer, Berlin, 1998, pp. 270.
  17. Oliver Wienand, Markus Wedler, Dominik Stoffel, Wolfgang Kunz, and Gert-Martin Greuel, An algebraic approach for proving data correctness in arithmetic data paths, Computer Aided Verification, Lecture Notes in Computer Science, vol. 5123, Springer Berlin/Heidelberg, 2008, pp. 473–486.