Results 1  10
of
9,131
On learning counting functions with queries
 in &quot;7th Annual ACM Conference on Computational Learning Theory, COLT'94
, 1994
"... We investigate the problem of learning disjunctions of counting functions, which are general cases of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class of disjunctions of integerweighted counting functions with modulus p over the ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We investigate the problem of learning disjunctions of counting functions, which are general cases of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class of disjunctions of integerweighted counting functions with modulus p over
On the depth complexity of the counting functions
 Information Processing Letters 35
, 1990
"... We use Karchmer and Wigderson's recent characterization of circuit depth in terms of communication complexity to design shallow Boolean circuits for the counting functions. We show that the MOD, counting function on n arguments can be computed by Boolean networks which contain negations and bi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We use Karchmer and Wigderson's recent characterization of circuit depth in terms of communication complexity to design shallow Boolean circuits for the counting functions. We show that the MOD, counting function on n arguments can be computed by Boolean networks which contain negations
On the Learnability of Counting Functions
"... We examine the learnability of concepts based on counting functions. A counting function is a generalization of a parity function in which the weighted sum of n inputs is tested for equivalence to some value k modulo N. The concepts we study therefore generalize many commonly studied boolean functio ..."
Abstract
 Add to MetaCart
We examine the learnability of concepts based on counting functions. A counting function is a generalization of a parity function in which the weighted sum of n inputs is tested for equivalence to some value k modulo N. The concepts we study therefore generalize many commonly studied boolean
Logical Definability of Counting Functions
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1996
"... The relationship between counting functions and logical expressibility is explored. The most well studied class of counting functions is #P, which consists of the functions counting the accepting computation paths of a nondeterministic polynomialtime Turing machine. For a logic L, #L is the clas ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The relationship between counting functions and logical expressibility is explored. The most well studied class of counting functions is #P, which consists of the functions counting the accepting computation paths of a nondeterministic polynomialtime Turing machine. For a logic L, #L
COUNTING FUNCTIONS OF MAGIC LABELLINGS
, 2010
"... A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. The most famous class of examples are magic squares (the sets are the rows, columns, and diagonals of a matrix). It follows from a recent pape ..."
Abstract
 Add to MetaCart
of generating functions for such counting functions. The software will utilize previously developed programs THAC (developed at SFSU) and Latte (developed at UC Davis) to compute intermediate results required by the overall computation. The symbolic algebra program Maple (developed at the University of Waterloo
Computing the Prime Counting Function
"... The best known algorithm for computing the prime counting function (prime_pi) and nth prime function of numbers within a practical range, hybrid table lookup and sieving, is described. The author implemented this algorithm for inclusion in Sage, the free opensource mathematics program. The author&a ..."
Abstract
 Add to MetaCart
The best known algorithm for computing the prime counting function (prime_pi) and nth prime function of numbers within a practical range, hybrid table lookup and sieving, is described. The author implemented this algorithm for inclusion in Sage, the free opensource mathematics program. The author
ON THE COMPARISON OF THE DIRICHLET AND NEUMANN COUNTING FUNCTIONS
, 812
"... Let NN(λ) and ND(λ) be the counting functions of the Dirichlet and Neumann Laplacian on a domain Ω ⊂ R n. If λ is not a Dirichlet or Neumann eigenvalue then (*) NN(λ) = ND(λ) + g − (λ), ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Let NN(λ) and ND(λ) be the counting functions of the Dirichlet and Neumann Laplacian on a domain Ω ⊂ R n. If λ is not a Dirichlet or Neumann eigenvalue then (*) NN(λ) = ND(λ) + g − (λ),
StrategyProofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions
 J. Econ. Theory
, 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract

Cited by 553 (0 self)
 Add to MetaCart
Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I
Singular Combinatorics
 ICM 2002 VOL. III 13
, 2002
"... Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit probability distributions present in large random structures. " ..."
Abstract

Cited by 800 (10 self)
 Add to MetaCart
Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit probability distributions present in large random structures
On Learning Counting Functions With Queries Abstract
"... We investigate the problem of learning disjunctions of counting functions, generalizations of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class of disjunctions of integerweighted counting functions with modulus p over the domain Z ..."
Abstract
 Add to MetaCart
We investigate the problem of learning disjunctions of counting functions, generalizations of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class of disjunctions of integerweighted counting functions with modulus p over the domain
Results 1  10
of
9,131