Closure properties of knapsack semilinear groups
From MaRDI portal
Recommendations
Cites work
- A complex for right-angled Coxeter groups
- Algorithmic meta theorems for circuit classes of constant and logarithmic depth
- Carathéodory bounds for integer cones
- Combinatorics on traces
- Compressed decision problems for graph products and applications to (outer) automorphism groups.
- Compressed word problems in HNN-extensions and amalgamated products
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Embedding Theorems for Groups
- FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM
- scientific article; zbMATH DE number 41228 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 1567775 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- scientific article; zbMATH DE number 871949 (Why is no real title available?)
- scientific article; zbMATH DE number 7139161 (Why is no real title available?)
- scientific article; zbMATH DE number 3381557 (Why is no real title available?)
- scientific article; zbMATH DE number 3414530 (Why is no real title available?)
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
- Knapsack in graph groups
- Knapsack in graph groups, HNN-extensions and amalgamated products
- Knapsack in hyperbolic groups
- Knapsack problem for nilpotent groups
- Knapsack problems for wreath products
- Knapsack problems in groups
- Knapsack problems in products of groups
- LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
- Membership problems for regular and context-free trace languages
- On the descriptional complexity of operations on semilinear sets
- On the rational subset problem for groups.
- RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
- Reducibility among combinatorial problems
- Semigroups, Presburger formulas, and languages
- Subgroup separability of graphs of abelian groups
- Subgroups of HNN Groups and Groups with one Defining Relation
- The Burnside problem and related topics.
- The co-word problem for the Higman-Thompson group is context-free
- The Complexity of Knapsack in Graph Groups
- The Subgroups of a Free Product of Two Groups with an Amalgamated Subgroup
- The taming of the semi-linear set
- Theories of HNN-Extensions and Amalgamated Products
- Unary finite automata vs. arithmetic progressions
- WORD EQUATIONS OVER GRAPH PRODUCTS
Cited in
(5)
This page was built for publication: Closure properties of knapsack semilinear groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2236107)