๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of counting homeomorphs

โœ Scribed by Graham Farr; Colin McDiarmid

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
202 KB
Volume
36
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The counting complexity of a simple sche
The counting complexity of a simple scheduling problem
โœ Gerardo Berbeglia ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 780 KB

Let T be a set of tasks. Each task has a non-negative processing time and a deadline. The problem of determining whether or not there is a schedule of the tasks in T such that a single machine can finish processing each of them before its deadline is polynomially solvable. We prove that counting the

Counting Functions and Expected Values f
Counting Functions and Expected Values for the k-Error Linear Complexity
โœ Wilfried Meidl; Harald Niederreiter ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

In cryptology, complexity measures for sequences of elements of a "nite "eld, such as the linear complexity, play an important role. Cryptographically strong sequences or "nite strings must not only have a large linear complexity, but also the change of a few terms must not cause a signi"cant decrea