Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"counting problems"”.
-
Clinical Studies of Counting Problems With Primary School Children
… analyzed to discover children's conceptions of counting. Using various complex counting tasks, the clinical interviews focused on place value, addition, subtraction, and multiplication. Five counting principles proposed by Gelman and Gallistel (1978) and three additional principles proposed by …
-
Algorithmic issues in queueing systems and combinatorial counting problems
… lower bounds on the number of objects they are counting, but can only give probabilistic estimates. We propose a set of deterministic algorithms for counting such objects for three classes of counting problems. They are interesting both because they give an alternative approach to solving these …
-
Topics in spectral theory of differential operators /
This dissertation is devoted to two eigenvalue counting problems: Determining the asymptotic behavior of large eigenvalues of self-adjoint extensions of partial differential operators, and computing the number of negative eigenvalues for bounded from below operators with compact resolvents. In the …
-
On threshold models over finite networks
… We then study the complexity of decision/counting problems that arise within the context. Specifically, we consider the tractability of counting the number of limit cycles and fixed-points, and deciding the reachability of action profiles. We finally propose a measure of network resilience …
-
Generalized Satisfiability Problems
… of complexity theory is the classification of problems with respect to their consumption of resources (e.g., running time or required memory). To study the computational complexity (i.e., consumption of resources) of problems, similar problems are grouped into so called complexity classes. …