Author: Dimacs (Group)DIMACS Workshop on Feasible Arithme
Publisher: American Mathematical Society
Keywords: dimacs, theoretical, mathematics, computer, vol, science, discrete, april, feasible, complexity, arithmetics, workshop, proof, series
Number of Pages: 320
Published: 1997-10
List price: $68.00
ISBN-10: 0821805770
ISBN-13: 9780821805770
Questions of mathematical proof and logical inference have been a significant thread in modern mathematics and have played a formative role in the development of computer science and artificial intelligence. Research in proof complexity and feasible theories of arithmetic aims at understanding not only whether logical inferences can be made, but also what resources are required to carry them out. Understanding the resources required for logical inferences has major implications for some of the most important problems in computational complexity, particularly the problem of wh
Authors:Dimacs (Group), M. F. Janowitz,
Publisher: Oxford University Press
Keywords: dimacs, october, bioconsensus, mathematics, computer, science, discrete, theoretical, center, working, group, meetings, series
Number of Pages: 242
Published: 2003-05-01
List price: $79.00
ISBN-10: 0821831976
ISBN-13: 9780821831977
Consensus methods developed in the context of voting, decision making, and other areas of the social and behavioral sciences have a variety of applications in the biological sciences, originally in taxonomy and evolutionary biology, and more recently in molecular biology. Typically, several alternatives (such as alternative phylogenetic trees, molecular sequences, or alignments) are produced using different methods or under different models, and then one needs to find a consensus solution. This volume is based on two DIMACS working group meetings on "bioconsensus". It prov
Authors:Dimacs (Group), Challenge Workshop (1991 Dimacs), Sa
Publisher: American Mathematical Society
Keywords: october, contemporary, mathematics, challenge, implementation, algorithms, third, dimacs, parallel
Number of Pages: 162
Published: 1997-02
List price: $51.00
ISBN-10: 0821804472
ISBN-13: 9780821804476
This volume is the result of the Third DIMACS Implementation Challenge that was conducted as part of the 1993--1994 Special Year on Parallel Algorithms. The Implementation Challenge was formulated in order to provide a forum for a concerted effort to study effective algorithms for combinatorial problems and to investigate opportunities for massive speedups on parallel computers. The challenge included two problem areas for research study: tree searching algorithms, used in game search and combinatorial optimization, for example, and algorithms for sparse graphs. Participan
Author: Neil ImmermanDIMACS Workshop on Descriptive Compl
Publisher: Amer Mathematical Society
Keywords: dimacs, discrete, series, mathematics, theoretical, science, computer, university, january, finite, complexity, models, proceedings, descriptive, workshop, princeton
Number of Pages: 248
Published: 1997-01
List price: $64.00
ISBN-10: 0821805177
ISBN-13: 9780821805176
"We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and making discoveries that will help explain some of the many mysteries of computation." ---from the Preface Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics. The volume presents arti
Author: DIMACS WORKSHOP ON UNUSUAL APPLICATIONSMelvyn B.
Publisher: American Mathematical Society,
Keywords: dimacs, unusual, applications, theory, number, theoretical, computer, discrete, science, january, workshop, center, series
Number of Pages: 264
Published: 2004-04
List price: $93.00
ISBN-10: 0821827030
ISBN-13: 9780821827031
This volume contains the proceedings of the workshop held at the DIMACS Center of Rutgers University (Piscataway, NJ) on Unusual Applications of Number Theory. Standard applications of number theory are to computer science and cryptology. In this volume, well-known number theorist, Melvyn B. Nathanson, gathers articles from the workshop on other, less standard applications in number theory, as well as topics in number theory with potential applications in science and engineering. The material is suitable for graduate students and researchers interested in number theory and i
Authors:Alexander Barg, Simon Litsyn,
Publisher: American Mathematical Society
Keywords: dimacs, association, schemes, codes, theoretical, science, mathematics, computer, center, workshop, november, series, discrete
Number of Pages: 303
Published: 2001-03
List price: $98.00
ISBN-10: 0821820745
ISBN-13: 9780821820742
This volume presents papers related to the DIMACS workshop, "Codes and Association Schemes". The articles are devoted to the following topics: applications of association schemes and of the polynomial method to properties of codes, structural results for codes, structural results for association schemes, and properties of orthogonal polynomials and their applications in combinatorics. Papers on coding theory are related to classical topics, such as perfect codes, bounds on codes, codes and combinatorial arrays, weight enumerators, and spherical designs. Papers on orthogonal
Author: DIMACS Workshop on Reliability of Computer and Com
Publisher: American Mathematical Society
Keywords: dimacs, december, series, discrete, mathematics, workshop, reliability, communication, networks, proceedings, computer
Number of Pages: 259
Published: 1991-07
List price: $51.00
ISBN-10: 0821865927
ISBN-13: 9780821865927
Reliability problems arise with increasing frequency as our systems of telecommunications, information transmission, transportation, and distribution become more and more complex. In December 1989 at DIMACS at Rutgers University, a Workshop on Reliability of Computer and Communication Networks was held to examine the discrete mathematical methods relevant to these problems. There were nearly ninety participants, including theoretical mathematicians, computer scientists, and electrical engineers from academia and industry, as well as network practitioners, engineers, and relia
