Computational irreducibility - PDFSEARCH.IO - Document Search Engine

Computational irreducibility
Results: 18

#	Item
1	EXCERPTED FROM SECTION 12.6 Computational Irreducibility Add to Reading List Source URL: wac.36f4.edgecastcdn.net - Date: 2017-05-18 19:38:34
2	Computational Irreducibility and Computational Analogy Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2015-10-12 16:05:50 Computability theory Theory of computation Turing machine Alan Turing Models of computation Computability ChurchTuring thesis Computable function Algorithm Reduction Turing completeness Machine that always halts
3	Department of Mathematics Texas A&M University 3368 TAMU College Station, TXF Add to Reading List Source URL: see-math.math.tamu.edu Language: English - Date: 2015-02-14 23:31:39 Computational number theory Cryptography Factorization of polynomials over a finite field and irreducibility tests Polynomials Anatolii Alexeevitch Karatsuba Mathematics Algebra Coding theory
4	Department of Mathematics Texas A&M University 3368 TAMU College Station, TXF Add to Reading List Source URL: see-math.math.tamu.edu Language: English - Date: 2015-02-14 23:22:02 Computational number theory Cryptography Factorization of polynomials over a finite field and irreducibility tests Polynomials Markov decision process Mathematics Coding theory Algebra
5	Texas A&M University Department of Mathematics Summer Educational Enrichment in Math (SEE Math) Program Dates: June 19 – June 30, 2006, 1:00 p.m. - 4:00 p.m Optional computer time 4 PM - 5 PM June 20 - June 28 Add to Reading List Source URL: see-math.math.tamu.edu Language: English - Date: 2006-04-06 15:50:07 Coding theory Computational number theory Factorization of polynomials over a finite field and irreducibility tests Polynomials Mathematics Combinatorics Mathematics education
6	On the hardness of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:57:00 Analysis of algorithms Time complexity Polynomials NP Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Mathematics Computational complexity theory
7	Approximating the average stretch factor of geometric graphs∗ Siu-Wing Cheng† Christian Knauer‡ Stefan Langerman§ Michiel Smid¶ Abstract Let G be a geometric graph whose vertex set S is a set of n points in Rd . Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2011-01-03 00:53:54 Finite fields Computational geometry Matroid theory Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Mathematics Polynomials Elliptic curves
8	Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 Abstract Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-06-09 14:57:08 Finite fields Computability theory Cryptographic protocols Computational complexity theory Diffie–Hellman problem XTR Random self-reducibility Oracle machine Reduction Theoretical computer science Applied mathematics Mathematics
9	Two Improved Range-Eﬃcient Algorithms for F0 Estimation He Sun1,2 and Chung Keung Poon1 1 2 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2007-04-12 14:13:22 Analysis of algorithms Computational complexity theory Time complexity Logarithm Big O notation Streaming algorithm Factorization of polynomials over a finite field and irreducibility tests Euclidean algorithm Theoretical computer science Mathematics Applied mathematics
10	Reptile Mystery Math Division Worksheet Add to Reading List Source URL: www.tlsbooks.com Language: English - Date: 2013-11-11 01:53:39 Computational number theory Cryptography Factorization of polynomials over a finite field and irreducibility tests XTR Polynomials Fiber bundles Coding theory