DIMACS Technical ReportJuly 1995 A Formal Framework for Evaluating Heuristic Programs 1 by

First Page		Document Content
Date: 2012-10-31 09:54:25 Mathematics Computational complexity theory Primality tests Finite fields Polynomials Combinatorial optimization Matching Algorithm Euclidean algorithm PP MillerRabin primality test XC		DIMACS Technical ReportJuly 1995 A Formal Framework for Evaluating Heuristic Programs 1 by Add to Reading List Source URL: www.cs.tufts.edu Download Document from Source Website File Size: 225,67 KB Share Document on Facebook

	Logical Methods in Computer Science Vol. 10(1:, pp. 1–29 www.lmcs-online.org Submitted Published DocID: 1xTZi - View Document
	Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published DocID: 1xTH1 - View Document
	PP_icon-1_Einladung_A4_L3.indd DocID: 1xTEi - View Document
	ADVANCE INFORMATION 100 POEMS ARE NOT ENOUGHNon-Fiction > Poetry Walking BookFairs-PAN ǀ Rs 299 ǀ 104 pp DocID: 1xTyC - View Document
	Logical Methods in Computer Science Vol. 4 (4:, pp. 1–21 www.lmcs-online.org Submitted Published DocID: 1xTht - View Document