We present an updated survey of the known constructions and bounds for (t, m, s)nets as well as tables of upper and lower bounds on their parameters for various bases. c © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 381–393, 1999

Joint Mass Spectrometry Centre, Chair of An University of Rostock, 18059 Rostock, Germa de; Tel: +49 381 498 6536 Joint Mass Spectrometry Centre, Cooper Analytics (CMA), Helmholtz Zentrum M Environmental Health (GmbH), Ingolstäd Germany Biological Oceanography, Leibniz Instit Warnemünde-Rostock, Germany Marine Chemistry, Leibniz Institute for Ba Rostock, Germany † Electronic supplementary infor...

We present an O(1:3247 n) algorithm for counting the number of satisfying assignments for instances of 2-SAT and an O(1:6894 n) algorithm for instances of 3-SAT. This is an improvement compared to the previously best known algorithms running in O(1:381 n) and O(1:739 n) time, respectively.

A Medicinal Chemistry, Monash Institute of Pharmaceutical Sciences, Monash University, 381 Royal Parade, Parkville, VIC 3052, Australia B Atlantic Centre for Green Chemistry, Department of Chemistry, Saint Mary's University, Halifax, Nova Scotia, Canada C Department of Surfactant Technology, IQAC-CSIC, Jordi Girona 18-26, 08034, Spain D Corresponding authors: E-mail: [email protected] or pe...

DONG CHEN1, PETER B. LUH2, LAKSHMAN S. THAKUR3 and JACK MORENO JR.4 1Aristeia Capital L.L.C., 381 Fifth Avenue, 6th Floor, New York, NY 10016, USA E-mail: dong [email protected] 2Department of Electrical and Computer Engineering, and 3School of Business Administration, University of Connecticut, Storrs, CT 06269, USA E-mail: [email protected] or [email protected] 4J. M. Products Inc., Southb...