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 32 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 such as numb...

Nov 13 2013
  A conjecture on the number of SDRs of a (t,n)-family
He D., Lu C.  European Journal of Combinatorics 33(1): 1-7, 2012. Type: Article

Given a family of sets, it is an interesting exercise to choose a distinct element from each set so that a meaningful pattern can emerge from the selection. Such problems arise, for example, in constructing Latin squares, and in the popular puzzle...

Jul 9 2012
  Finding frequent items over sliding windows with constant update time
Hung R., Lee L., Ting H.  Information Processing Letters 110(7): 257-260, 2010. Type: Article

The authors present an algorithm for estimating the frequent items that occur in a sliding window of a data stream. If the window size is N data stream symbols, is a user-defined threshold, and is a relative error b...

Mar 17 2011
  Classification of computably approximable real numbers
Zheng X.  Theory of Computing Systems 43(3): 603-624, 2008. Type: Article

Real numbers can be represented mathematically in several equivalent ways, but these representations are not equivalent when they are used to compute real numbers and real functions. Although all representations yield computable real numbers, some...

Jul 21 2009
  On the number of facets of three-dimensional Dirichlet Stereohedra III: full cubic groups
Sabariego P., Santos F.  Discrete & Computational Geometry 40(2): 159-189, 2008. Type: Article

Suppose that S is a discrete point set in Rn. For any point p S, the Voronoi o region is the set of points in
Apr 16 2009
  Random bichromatic matchings
Bhatnagar N., Randall D., Vazirani V., Vigoda E.  Algorithmica 50(4): 418-445, 2008. Type: Article

The thermodynamic properties of a film of diatomic molecules accumulated through adsorption on a surface can be studied through a lattice of dimers. Abstractly, this is a grid graph of horizontal and vertical edges, usually on a torus....

Jun 11 2008
  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 w
Jul 10 2006
  Ants, bikes and clocks: problem solving for undergraduates
Briggs W.,  Society for Industrial and Applied Mathematics, Philadelphia, PA, 2004. 168 pp. Type: Book (9780898715743)

I assume that most students who take undergraduate courses in science or engineering are at some point in time unable to solve some of the proposed problems or exercises, despite having a good theoretical knowledge of the topic. They may know the ...

Feb 22 2006
  On the minimum size of some minihypers and related linear codes
Maruta T., Landjev I., Rousseva A.  Designs, Codes and Cryptography 34(1): 5-15, 2005. Type: Article

Given a prime power q, and positive integers n, k, and d, one of the classical problems of algebraic coding theory is to ask whether there exists a k-di...

Aug 29 2005
  Permutation statistics and the q, t-Catalan sequence
Loehr N.  European Journal of Combinatorics 26(1): 83-93, 2005. Type: Article

The Catalan numbers play a prominent role in combinatorics. Stanley’s book on enumerative combinatorics [1] lists over 95 collections of objects counted by the Catalan numbers. One of the collections of objects counted by the Catalan numbers...

May 13 2005
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy