Irreducibility

Results: 152



#Item
51A Polynomial Time Algorithm for Diophantine Equations in One Variable Felipe Cucker Department of Mathematics City University of Hong Kong 83 Tat Chee Avenue, Kowloon

A Polynomial Time Algorithm for Diophantine Equations in One Variable Felipe Cucker Department of Mathematics City University of Hong Kong 83 Tat Chee Avenue, Kowloon

Add to Reading List

Source URL: www6.cityu.edu.hk

Language: English - Date: 2012-09-11 23:37:27
52Undecidability and Intractability in Theoretical PhysicsPhysical processes are viewed as computations, and the difficulty of answering

Undecidability and Intractability in Theoretical PhysicsPhysical processes are viewed as computations, and the difficulty of answering

Add to Reading List

Source URL: www.stephenwolfram.com

Language: English - Date: 2013-09-24 11:02:15
53Microsoft Word - 9ME4Q.doc

Microsoft Word - 9ME4Q.doc

Add to Reading List

Source URL: www.bca.hkeaa.edu.hk

Language: English - Date: 2011-11-10 20:31:04
54Quantum algorithms (CO 781/CS 867/QIC 823, Winter[removed]Andrew Childs, University of Waterloo LECTURE 19: The polynomial method In this lecture we discuss a second method for establishing lower bounds on quantum query co

Quantum algorithms (CO 781/CS 867/QIC 823, Winter[removed]Andrew Childs, University of Waterloo LECTURE 19: The polynomial method In this lecture we discuss a second method for establishing lower bounds on quantum query co

Add to Reading List

Source URL: www.math.uwaterloo.ca

Language: English - Date: 2011-03-22 17:27:48
55Sage Reference Manual: Finite Rings Release 6.6.beta0 The Sage Development Team  February 21, 2015

Sage Reference Manual: Finite Rings Release 6.6.beta0 The Sage Development Team February 21, 2015

Add to Reading List

Source URL: sagemath.org

Language: English - Date: 2015-02-21 07:35:21
56The University of  Warwick THEORY OF COMPUTATION REPORT

The University of Warwick THEORY OF COMPUTATION REPORT

Add to Reading List

Source URL: eprints.dcs.warwick.ac.uk

Language: English - Date: 2012-04-27 07:42:11
57Irreducible Values of Polynomials: a Non-analogy Keith Conrad Department of Mathematics, Univ. of Connecticut, Storrs, CT[removed]U.S.A. [removed]

Irreducible Values of Polynomials: a Non-analogy Keith Conrad Department of Mathematics, Univ. of Connecticut, Storrs, CT[removed]U.S.A. [removed]

Add to Reading List

Source URL: www.math.uconn.edu

Language: English - Date: 2005-03-25 22:17:27
58On the linear complexity of Sidel’nikov Sequences over nonprime fields Nina Brandst¨atter a , Wilfried Meidl b a Johann  Radon Institute for Computational and Applied Mathematics, Austrian

On the linear complexity of Sidel’nikov Sequences over nonprime fields Nina Brandst¨atter a , Wilfried Meidl b a Johann Radon Institute for Computational and Applied Mathematics, Austrian

Add to Reading List

Source URL: research.sabanciuniv.edu

Language: English - Date: 2008-06-03 16:50:30
592001  “garcia de galdeano” PRE-PUBLICACIONES del seminario matematico

2001 “garcia de galdeano” PRE-PUBLICACIONES del seminario matematico

Add to Reading List

Source URL: www.unizar.es

Language: English - Date: 2001-07-04 05:26:06
60COLLEGE OF ARTS AND SCIENCES  115 MATHEMATICS Faculty

COLLEGE OF ARTS AND SCIENCES 115 MATHEMATICS Faculty

Add to Reading List

Source URL: www.math.armstrong.edu

Language: English - Date: 2009-01-16 16:46:37