1 Optimizing Busy Time on Parallel Machines George B. Mertzios∗ , Mordechai Shalom† , Ariella Voloshin‡ , Prudence W.H. Wong§ and Shmuel Zaks‡ ∗ School of Engineering and Computing Sciences, Durham University

First Page		Document Content
Date: 2012-02-08 11:20:14 Graph theory Mathematics Operations research Mathematical optimization NP-complete problems Dynamic programming Equations Systems engineering Independent set Interval scheduling Interval graph Approximation algorithm		1 Optimizing Busy Time on Parallel Machines George B. Mertzios∗ , Mordechai Shalom† , Ariella Voloshin‡ , Prudence W.H. Wong§ and Shmuel Zaks‡ ∗ School of Engineering and Computing Sciences, Durham University Add to Reading List Source URL: cgi.csc.liv.ac.uk Download Document from Source Website File Size: 287,96 KB Share Document on Facebook

	Operating Degrees for XL vs. F4/F5 for Generic MQ with Number of Equations Linear in That of Variables Jenny Yuan-Chun Yeh, Chen-Mou Cheng, and Bo-Yin Yang Academia Sinica, Taipei, Taiwan {jenny,doug,by}@crypto.tw Abstra DocID: 1xVBQ - View Document
	Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–2378) QUANTITATIVE PROPAGATION OF SMALLNESS FOR SOLUTIONS OF ELLIPTIC EQUATIONS Alexander Logunov and Eugenia Malinnikova DocID: 1xVgR - View Document
	Asymptotically faster quantum algorithms to solve multivariate quadratic equations Daniel J. Bernstein1 and Bo-Yin Yang2 1 Department of Computer Science DocID: 1xUCK - View Document
	Sparse Boolean Equations and Circuit Lattices Igor Semaev University of Bergen Norway SHARCS, 9 September 2009 DocID: 1xUha - View Document
	MODULI OF STOKES TORSORS AND SINGULARITIES OF DIFFERENTIAL EQUATIONS by Jean-Baptiste Teyssier Abstract. — Let M be a meromorphic connection with poles along a smooth divisor DocID: 1xU9F - View Document