论文信息 - Theory of Computing

Theory of Computing

Instructions This practical is longer than last week's and you are encouraged to do the work in pairs. You and your prac partner must have the same tutor. Please hand in only one submission per pair. You are free to divide the work as you see fit. As this is the last practical you are to required to submit it in the CS2 submissions box by 5:00pm on Saturday 27 May. Random Graphs Example code is provided which will generate random, weighted, directed graphs. These graphs are available in a matrix format, or as a list of edges. In addition it is possible to specify a seed number so that the same random graph is always generated. You will find the code useful for the first two questions.

L. Babai | R. Beals

[1] William M. Kantor,et al. Sylow's Theorem in Polynomial Time , 1985, J. Comput. Syst. Sci..

[2] Pierre McKenzie,et al. Parallel Algorithms for Solvable Permutation Groups , 1988, J. Comput. Syst. Sci..

[3] Nicolas James Doye. Order sorted computer algebra and coercions , 1997 .

[4] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[5] James H. Davenport. Abstract Data Types in Computer Algebra , 2000, MFCS.

[6] Fritz Schwarz. ALLTYPES: AN ALGEBRAIC LANGUAGE AND TYPE SYSTEM , 2002 .

[7] Teresa Krick,et al. The Computational Complexity of the Chow Form , 2002, Found. Comput. Math..

[8] César Domínguez,et al. Modeling Inheritance as Coercion in the Kenzo System , 2006, J. Univers. Comput. Sci..

[9] V. I. Sushchanskii,et al. A software system for growth analysis of mealy automata , 2006 .

[10] Barry M. Trager,et al. Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation , 2006, ISSAC 2006.

[11] Markus Wedler,et al. An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths , 2008, CAV.

[12] Murat Cenk,et al. On multiplication in finite fields , 2010, J. Complex..