Computer Science Technical Report Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe

First Page		Document Content
Date: 2010-06-24 19:04:53 Coding theory Mathematical analysis Topology Mathematical optimization Pseudo-Boolean function Metric Function Hamming distance Walsh–Hadamard code Mathematics Geometry Metric geometry		Computer Science Technical Report Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe Add to Reading List Source URL: www.cs.colostate.edu Download Document from Source Website File Size: 227,37 KB Share Document on Facebook

	Geometry & Topology–Topological properties of Hilbert schemes of almost-complex four-manifolds II DocID: 1xVL5 - View Document
	Algebraic & Geometric Topology–Generic representations of orthogonal groups: the mixed functors DocID: 1xVsM - View Document
	Geometry & Topology–K –duality for stratified pseudomanifolds C LAIRE D EBORD DocID: 1xVky - View Document
	NetHide: Secure and Practical Network Topology Obfuscation Roland Meier∗ , Petar Tsankov∗ , Vincent Lenders , Laurent Vanbever∗ , Martin Vechev∗ ∗ ETH Zürich DocID: 1xVcN - View Document
	NetHide: Secure and Practical Network Topology Obfuscation Roland Meier∗ , Petar Tsankov∗ , Vincent Lenders , Laurent Vanbever∗ , Martin Vechev∗ ∗ ETH Zürich DocID: 1xV3c - View Document