1199 search results - page 49 / 240 » Parameterized Proof Complexity |
WSC
1989
13 years 10 months ago
1989
Proof Animation™ is a family of products for animating discrete event simulations. Proof is available in a variety of versions, including an inexpensive, student version, midsiz...
ASIACRYPT
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
MST
2011
13 years 3 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
CEC
2009
IEEE
14 years 3 months ago
2009
IEEE
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...