Results 1  10
of
8,717
PRIMES IN INTERVALS OF BOUNDED LENGTH
"... Abstract. In April 2013, Yitang Zhang proved the existence of a finite bound B such that there are infinitely many pairs of distinct primes which differ by no more than B. This is a massive breakthrough, makes the twin prime conjecture look highly plausible (which can be reinterpreted as the conjec ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. In April 2013, Yitang Zhang proved the existence of a finite bound B such that there are infinitely many pairs of distinct primes which differ by no more than B. This is a massive breakthrough, makes the twin prime conjecture look highly plausible (which can be re
Bounded Length UCFG Equivalence
, 1996
"... . A randomised polylog time algorithm is given for deciding whether or not the sets of words of a given length generated by two unambiguous contextfree grammars coincide. The algorithm is in randomised NC4 in terms of the product of the grammar size and the length. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. A randomised polylog time algorithm is given for deciding whether or not the sets of words of a given length generated by two unambiguous contextfree grammars coincide. The algorithm is in randomised NC4 in terms of the product of the grammar size and the length. 1
On Sharply Bounded Length Induction
"... Abstract. We construct models of the theory L 0 2: = BASIC + Σ b 0LIND: one where the predecessor function is not total and one not satisfying Σ b 0PIND, showing that L 0 2 is strictly weaker that S 0 2. The construction also shows that S 0 2 is not ∀Σ b 0axiomatizable. ..."
Abstract
 Add to MetaCart
Abstract. We construct models of the theory L 0 2: = BASIC + Σ b 0LIND: one where the predecessor function is not total and one not satisfying Σ b 0PIND, showing that L 0 2 is strictly weaker that S 0 2. The construction also shows that S 0 2 is not ∀Σ b 0axiomatizable.
Reliable Identification of Boundedlength Viruses is NPcomplete
, 2003
"... A virus is a program that replicates itself by copying its code into other files. A common virus protection mechanism involves scanning files to detect code patterns of known viruses. We prove that the problem of reliably identifying a boundedlength mutating virus is NPcomplete by showing that a v ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
A virus is a program that replicates itself by copying its code into other files. A common virus protection mechanism involves scanning files to detect code patterns of known viruses. We prove that the problem of reliably identifying a boundedlength mutating virus is NPcomplete by showing that a
two disjoint paths of bounded length
"... Approximation algorithms for forests augmentation ensuring ..."
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
"... Abstract. We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both problems are equivalent (and computationally easy) in the unbounded case for single source, single target paths. Howe ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both problems are equivalent (and computationally easy) in the unbounded case for single source, single target paths
Stable marriage with ties and bounded length preference lists
 IN PROC. ACID, VOLUME 7 OF TEXTS IN ALGORITHMICS, 95–106
"... We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign graduating medical students to their first hospital ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign graduating medical students to their first hospital
An Efficient ContextFree Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract

Cited by 798 (0 self)
 Add to MetaCart
A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general
Results 1  10
of
8,717