Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Combinatorics (G.2.1) > Counting Problems (G.2.1...)  
 
Options:
 
  1-10 of 11 Reviews about "Counting Problems (G.2.1...)": Date Reviewed
  Combinatorics of 4-dimensional resultant polytopes
Dickenstein A., Emiris I., Fisikopoulos V.  ISSAC 2013 (Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, Boston, MA, Jun 26-29, 2013) 173-180, 2013.  Type: Proceedings

The resultant of two polynomials is an expression constructed from those polynomials such that it is zero precisely when the two polynomials share a root. Because of its desirable properties, the resultant is frequently used in fields ...

Nov 13 2013
  Counting bordered and primitive words with a fixed weight
Harju T., Nowotka D. Theoretical Computer Science 340(2): 273-279, 2005.  Type: Article

A word w is primitive if w cannot be written in the form uk for any k greater than 1, and w is bordered if some proper prefix of ...

Jul 10 2006
  On distinct distances from a vertex of a convex polygon
Dumitrescu A.  Computational geometry (Proceedings of the twentieth annual symposium on computational geometry, New York, NY, Jun 8-11, 2004) 57-60, 2004.  Type: Proceedings

Paul Erdös first introduced the general topic of this paper in 1946 [1]. That topic was how to determine the minimum number of distinct distances determined by n points in the plane. The author looks at a va...

Aug 4 2004
  Analytical depoissonization and its applications
Jacquet P., Szpankowski W. (ed) Theoretical Computer Science 201(1-2): 1-62, 1998.  Type: Article

The authors’ abstract offers a clear description of the paper’s contents. Jacquet and Szpankowski’s readable account of depoissonization and its use in analysis of the algorithms and combinatorics contains...

May 1 1999
  Approximation algorithms for multiple sequence alignment
Bafna V., Lawler E., Pevzner P. Theoretical Computer Science 182(1-2): 233-244, 1997.  Type: Article

Interspecies relationships, the ongoing human genome project, and the accelerating interest in genetic engineering for disease control have generated a parallel activity in computational genetics. This paper considers the problem of al...

Apr 1 1998
  Algorithms for enumerating all spanning trees of undirected and weighted graphs
Kapoor S., Ramesh H. SIAM Journal on Computing 24(2): 247-265, 1995.  Type: Article

Two explicit algorithms are given to quickly list all the spanning trees in an undirected graph. The main idea is to list the spanning trees in such a way that each tree output differs from the previous one only by the exchange of two ...

Jul 1 1996
  Mellin transforms and asymptotics
Flajolet P., Grabner P., Kirschenhofer P., Prodinger H., Tichy R. Theoretical Computer Science 123(2): 291-314, 1994.  Type: Article

A digital sum is the number of occurrences of the digit 1, or some other pattern of digits, in the codes (for some type of code) of 0 , 1 ,..., n - 1. A well-known digital sum is the number of occurrences of the digi...

Jan 1 1996
  A very hard log-space counting class
Álvarez C., Jenner B. Theoretical Computer Science 107(1): 3-30, 1993.  Type: Article

The authors introduce and investigate three natural new counting classes, which are abbreviated as #L, span-L, and opt-L. “Functions in #L count the number of accepting computations of a nondeterministic log-space-bounded Tur...

Aug 1 1994
  Enumeration of polyominoes using MACSYMA
Delest M. (ed) Theoretical Computer Science 79(1): 209-226, 1991.  Type: Article

The combinatorial objects discussed in this paper, polyominoes, are connected finite unions of unit squares in the plane. Among the parameters of interest in enumerating polyominoes are area (number of squares) and perimeter (length of...

Nov 1 1992
  On counting lattice points in polyhedra
Dyer M. SIAM Journal on Computing 20(4): 695-707, 1991.  Type: Article

Lattice points are points in any prescribed space all of whose components are integers. Often the underlying space is ordinary n-dimensional Euclidean space En, where a lattice point becomes simply an n-...

Aug 1 1992
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy