| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 17
reviews
|
|
|
 |
|
|
|
|
 Discrete mathematics and its applications
Rosen K., McGraw-Hill Higher Education, Columbus, OH, 2002. 928 pp. Type: Book (9780072424348)
This thoughtful and well-written introductory text is designed for students at the sophomore level in a variety of majors, including mathematics, computer science, and engineering. The book, now in its fifth edition, is billed by its p...
|
May 7 2003 |
|
|
|
|
|
|
Combinatorics for computer science
Williamson S., Dover Publications, Inc., New York, NY, 1985. 479 pp. Type: Book (9780486420769)
This book, an unabridged paperback republication of the original edition published in 1985 [1], is organized into two parts, along the general lines of enumeration and graph theory. The two parts are independent, and can be read in ei...
|
Nov 8 2002 |
|
|
|
|
|
|
Resolution of Hartmanis’ conjecture for NL-hard sparse sets
Cai J., Sivakumar D. Theoretical Computer Science 240(2): 257-269, 2000. Type: Article
Berman and Hartmanis [1] showed in the 1970s that, under polynomial-time computable reductions, all known NP-complete languages are isomorphic. Hartmanis [2] showed the same to be true for P and NL (nondeterministic logspace): all know...
|
Nov 1 2001 |
|
|
|
|
|
|
Discrete mathematics using a computer
Hall C., O’Donnell J., Springer-Verlag New York, Inc., New York, NY, 2000. 339 pp. Type: Book (9781852330897)
The central theme of this book is the connection between computing and discrete mathematics. Designed primarily for a one-semester first- or second-year course for undergraduate students of computer science, the book focuses on logic, ...
|
May 1 2000 |
|
|
|
|
|
|
A rated-clock test method for path delay faults
Bose S., Agrawal P., Agrawal V. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 6(2): 323-331, 1998. Type: Article
As noted in the abstract and introduction, current test generation algorithms for path delay faults assume a variable clock (also known as dual clock) methodology for test application. A two-vector sequence is a valid test only if the ...
|
Feb 1 1999 |
|
|
|
|
|
|
Solving a multivariable congruence by change of term order
Fitzpatrick P. Journal of Symbolic Computation 24(5): 575-589, 1997. Type: Article
Fitzpatrick considers the congruence , where h1 ,..., hs are given polynomials modulo a zero-dimensional ideal I. Two p...
|
Nov 1 1998 |
|
|
|
|
|
|
Efficient delay routing
Di Ianni M. Theoretical Computer Science 196(1-2): 131-151, 1998. Type: Article
The computational complexity of packet routing schemes that are provably efficient with respect to end-to-end delay is considered. This work focuses on finding algorithms that can optimize both the end-to-end delay when the number of p...
|
Nov 1 1998 |
|
|
|
|
|
|
Fully dynamic secret sharing schemes
Blundo C., Cresti A., De Santis A., Vaccaro U. Theoretical Computer Science 165(2): 407-440, 1996. Type: Article
A secret sharing scheme allows a secret to be divided among a set P of participants so that only qualified subsets of P can reconstruct the secret by pooling their information, but any nonqualified...
|
Oct 1 1997 |
|
|
|
|
|
|
Calculating invariant rings of finite groups over arbitrary fields
Kemper G. Journal of Symbolic Computation 21(3): 351-366, 1996. Type: Article
Throughout this well-written paper, K is an arbitrary field and G ≤ G Ln ( K ) is a finite matrix group of degree n over K. G
|
Aug 1 1997 |
|
|
|
|
|
|
Characterization and complexity of uniformly nonprimitive labeled 2-structures
Engelfriet J., Harju T., Proskurowski A. (ed), Rozenberg G. (ed) Theoretical Computer Science 154(2): 247-282, 1996. Type: Article
A labeled 2-structure is an arc-labeled complete digraph that has a finite number of vertices. Perhaps the basic result of the theory of 2-structures is the clan decomposition theorem (1990) of Ehrenfeucht and Rozenberg. By this theore...
|
Feb 1 1997 |
|
|
|
|
|
| |
|
|
| |
|
|
