8825 search results - page 25 / 1765 » All for one or one for all |
IPL
1998
13 years 7 months ago
1998
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
COMBINATORICS
1999
13 years 7 months ago
1999
Let m and n be positive integers, and let R = (r1, . . . , rm) and S = (s1, . . . , sn) be non-negative integral vectors. Let A(R, S) be the set of all m
CSL
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
DM
1999
13 years 7 months ago
1999
Pascal's rhombus is a variation of Pascal's triangle in which values are computed as the sum of four terms, rather than two. It is shown that the limiting ratio of the n...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...