Results 11 to 20 of about 1,078 (84)
The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The Permutation Pattern Matching problem, asking whether a pattern permutation $\pi$ is contained in a permutation $\tau$, is known to be NP-complete. In this paper we present two polynomial time algorithms for special cases.
Michael H. Albert +3 more
doaj +1 more source
The Subpower Membership Problem for Finite Algebras with Cube Terms [PDF]
Logical Methods in Computer Science, 2019 The subalgebra membership problem is the problem of deciding if a given element belongs to an algebra given by a set of generators. This is one of the best established computational problems in algebra.
Andrei Bulatov +2 more
doaj +1 more source
A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application
Journal of Inequalities and Applications, 2014 We obtain a fixed point theorem for a type of generalized contractions on preordered complete fuzzy quasi-metric spaces which is applied to deduce, among other results, a procedure to show in a direct and easy fashion the existence of solution for the ...
Francisco Castro-Company +2 more
semanticscholar +2 more sources
Discussiones Mathematicae Graph Theory, 2020 If S = (a1, a2, . . .) is a non-decreasing sequence of positive integers, then an S-packing coloring of a graph G is a partition of V (G) into sets X1, X2, . . .
Brešar Boštjan +3 more
doaj +1 more source
Theory of Computing, 2013 We give an overview of the history of fast algorithms for matrix multiplication. Along the way, we look at some other fundamental problems in algebraic complexity like polynomial evaluation. This exposition is self-contained.
M. Bläser
semanticscholar +1 more source
The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives [PDF]
, 2017 In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.Comment: 8 ...
Gadiyar, H. Gopalakrishna, Padma, R.
core +3 more sources
Pushing for weighted tree automata [PDF]
Logical Methods in Computer Science, 2018 A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it is most useful ...
Thomas Hanneforth +2 more
doaj +1 more source
Packing a bin online to maximize the total number of items [PDF]
, 1996 A bin of capacity 1 and a nite sequence of items of\ud sizes a1; a2; : : : are considered, where the items are given one by one\ud without information about the future.
Faigle, Ulrich, Kern, Walter
core +3 more sources
A variant of the large sieve inequality with explicit constants
Journal of Mathematical Cryptology, 2020 We give an effective version with explicit constants of the large sieve inequality for imaginary quadratic fields. Explicit results of this kind are useful for estimating the computational complexity of algorithms which generate elements, whose norm is a
Grześkowiak Maciej
doaj +1 more source
A Brief Introduction to Fourier Analysis on the Boolean Cube
Theory of Computing, 2008 We give a brief introduction to the basic notions of Fourier analysis on the Boolean cube, illustrated and motivated by a number of applications to theoretical computer science. ACM Classification: F.0, F.2 AMS Classification: 42-02, 68-02, 68Q17, 68Q25,
R. D. Wolf
semanticscholar +1 more source