Pages that link to "Item:Q4162481"

The following pages link to Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems (Q4162481):

Displaying 21 items.

• The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
• Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
• Complexity results in graph reconstruction (Q867853) (← links)
• Graph isomorphism problem (Q1057883) (← links)
• Testing homotopy equivalence is isomorphism complete (Q1072577) (← links)
• Testing for grammatical coverings (Q1080663) (← links)
• Concerning the complexity of deciding isomorphism of block designs (Q1159699) (← links)
• Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
• Graph isomorphism, general remarks (Q1255944) (← links)
• Subcomplete generalizations of graph isomorphism (Q1838044) (← links)
• The complexity of Boolean matrix root computation (Q1884841) (← links)
• The isomorphism problem for varieties generated by a two-element algebra (Q1905991) (← links)
• The complexity of homomorphism factorization (Q2046363) (← links)
• Computational complexity of problems for deterministic presentations of sofic shifts (Q2087461) (← links)
• Theoretical and computational advances for network diversion (Q2811311) (← links)
• On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (Q2947416) (← links)
• Construction of an effective algorithm to find the isomorphism of two simple finite semigroups (Q3787485) (← links)
• The complexity of computing the automorphism group of automata and related problems (Q3811719) (← links)
• On the complexity of graph reconstruction (Q4298372) (← links)
• Nominal Unification and Matching of Higher Order Expressions with Recursive Let (Q5075515) (← links)
• INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS (Q5470161) (← links)