1632 search results - page 43 / 327 » On special numberings of hypergraphs |
211
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
181
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
165
click to vote
TAGT
1994
Springer
15 years 10 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
173
click to vote
CORR
2008
Springer
2008
Springer
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
15 years 6 months ago
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
153
click to vote
DCC
1999
IEEE
15 years 6 months ago
1999
IEEE
Recently, P.J. Cameron studied a class of block designs which generalises the classes of t-designs, -resolved 2-designs, orthogonal arrays, and other classes of combinatorial desi...