Equivalence and membership problems for regular trace languages

1982 ◽  
pp. 61-71 ◽  
Author(s):  
A. Bertoni ◽  
G. Mauri ◽  
N. Sabadini
Keyword(s):  
Membership Problems

scholarly journals Gaussian random projections for Euclidean membership problems

2019 ◽  
Vol 253 ◽  
pp. 93-102 ◽  
Author(s):  
Ky Vu ◽  
Pierre-Louis Poirion ◽  
Leo Liberti
Keyword(s):  
Random Projections ◽  
Membership Problems

Problems in Cryptography and Cryptanalysis

2018 ◽  
pp. 23-39
Author(s):  
Kannan Balasubramanian ◽  
Rajakani M.
Keyword(s):  
Elliptic Curve ◽  
Optimization Problems ◽  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Random Number Generators ◽  
Factorization Problem ◽  
Diffie Hellman ◽  
Integer Factorization Problem ◽  
Diffie Hellman Key Exchange ◽  
Membership Problems

The integer factorization problem used in the RSA cryptosystem, the discrete logarithm problem used in Diffie-Hellman Key Exchange protocol and the Elliptic Curve Discrete Logarithm problem used in Elliptic Curve Cryptography are traditionally considered the difficult problems and used extensively in the design of cryptographic algorithms. We provide a number of other computationally difficult problems in the areas of Cryptography and Cryptanalysis. A class of problems called the Search problems, Group membership problems, and the Discrete Optimization problems are examples of such problems. A number of computationally difficult problems in Cryptanalysis have also been identified including the Cryptanalysis of Block ciphers, Pseudo-Random Number Generators and Hash functions.

Membership Problem for Two-Dimensional General Row Jumping Finite Automata

2020 ◽  
Vol 31 (04) ◽  
pp. 527-538
Author(s):  
Grzegorz Madejski ◽  
Andrzej Szepietowski
Keyword(s):  
Computational Model ◽  
Turing Machine ◽  
Finite Automaton ◽  
Finite Automata ◽  
The Other ◽  
Membership Problem ◽  
Two Dimensional ◽  
Np Complete ◽  
Nondeterministic Turing Machine ◽  
Membership Problems

Two-dimensional general row jumping finite automata were recently introduced as an interesting computational model for accepting two-dimensional languages. These automata are nondeterministic. They guess an order in which rows of the input array are read and they jump to the next row only after reading all symbols in the previous row. In each row, they choose, also nondeterministically, an order in which segments of the row are read. In this paper, we study the membership problem for these automata. We show that each general row jumping finite automaton can be simulated by a nondeterministic Turing machine with space bounded by the logarithm. This means that the fixed membership problems for such automata are in NL, and so in P. On the other hand, we show that the uniform membership problem is NP-complete.

INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS

2006 ◽  
Vol 16 (01) ◽  
pp. 119-140 ◽  
Author(s):  
MARCEL JACKSON ◽  
RALPH McKENZIE
Keyword(s):  
Membership Problem ◽  
Finite Semigroups ◽  
Variety Of Semigroups ◽  
Membership Problems

We show that a number of natural membership problems for classes associated with finite semigroups are computationally difficult. In particular, we construct a 55-element semigroup S such that the finite membership problem for the variety of semigroups generated by S interprets the graph 3-colorability problem.

COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS

2007 ◽  
Vol 17 (08) ◽  
pp. 1635-1666 ◽  
Author(s):  
MARCIN KOZIK
Keyword(s):  
Finite Algebra ◽  
Membership Problem ◽  
Membership Problems

In this paper we produce a finite algebra which generates a variety with a PSPACE-complete membership problem. We produce another finite algebra with a γ function that grows exponentially. The results are obtained via a modification of a construction of the algebra A(T) that was introduced by McKenzie in 1996.

Sign in / Sign up

Export Citation Format

Share Document