Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView

Generic-case approach to algorithmic problems was suggested by A. Miasnikov, I. Kapovich, P. Schupp and V. Shpilrain in 2003. This approach studies behavior of an algo-rithm on typical (almost all) inputs and ignores the rest of inputs. In this paper, we prove that the subset sum problems for the monoid of integer positive unimodular matrices of the second order, the special linear group of the second order, and the modular group are generically solvable in polynomial time.

Download Full-text

Hiding expressed using relation algebra with multi-relations-oblique lifting and lowering for unbalanced systems

Proceedings of the Fourth European Conference on Software Maintenance and Reengineering ◽

10.1109/csmr.2000.827304 ◽

2002 ◽

Cited By ~ 3

Author(s):

R.J. Bril ◽

L.M.G. Feijs ◽

A. Glas ◽

R.L. Krikhaar ◽

T. Winter

Keyword(s):

Relation Algebra

Download Full-text

Performance-influencing Factors for Parallel and Algorithmic Problems in Multicore Environments

Companion of the 2019 ACM/SPEC International Conference on Performance Engineering - ICPE '19 ◽

10.1145/3302541.3313099 ◽

2019 ◽

Author(s):

Markus Frank ◽

Steffen Becker ◽

Angelika Kaplan ◽

Anne Koziolek

Keyword(s):

Influencing Factors ◽

Algorithmic Problems ◽

Performance Influencing Factors

Download Full-text

Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees

Information Systems ◽

10.1016/j.is.2019.101467 ◽

2020 ◽

Vol 89 ◽

pp. 101467 ◽

Cited By ~ 1

Author(s):

Jelle Hellings ◽

Marc Gyssens ◽

Yuqing Wu ◽

Dirk Van Gucht ◽

Jan Van den Bussche ◽

...

Keyword(s):

Transitive Closure ◽

Relation Algebra

Download Full-text

Allowed Boundary Sequences for Fused Polycyclic Patches and Related Algorithmic Problems

Journal of Chemical Information and Computer Sciences ◽

10.1021/ci000060o ◽

2001 ◽

Vol 41 (2) ◽

pp. 300-308 ◽

Cited By ~ 9

Author(s):

Michel Deza ◽

Patrick W. Fowler ◽

Viatcheslav Grishukhin

Keyword(s):

Algorithmic Problems

Download Full-text

Conjugacy Problem in the Fundamental Groups of High-Dimensional Graph Manifolds

Mathematics ◽

10.3390/math9121330 ◽

2021 ◽

Vol 9 (12) ◽

pp. 1330

Author(s):

Raeyong Kim

Keyword(s):

Group Structure ◽

Conjugacy Problem ◽

High Dimensional ◽

Fundamental Groups ◽

Graph Manifold ◽

Solvable Word Problem ◽

Algorithmic Problems ◽

Graph Manifolds ◽

Dimensional Graph ◽

Solvable Word

The conjugacy problem for a group G is one of the important algorithmic problems deciding whether or not two elements in G are conjugate to each other. In this paper, we analyze the graph of group structure for the fundamental group of a high-dimensional graph manifold and study the conjugacy problem. We also provide a new proof for the solvable word problem.

Download Full-text