scientific article; zbMATH DE number 1104166

MaRDI QIDQ4370033zbMATH OpenFDO

Authors N. V. Vinodchandran

Publication date 29 November 1998

zbMATH Keywords

complexitycomputational group theorycoset intersectionsdecision problemsgroup factorizationsgroup isomorphismssolvability testssolvable black-box groups

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Solvable black-box group problems are low for \(\mathrm{PP}\)
• Solvable black-box group problems are low for PP
• Counting Complexity of Solvable Black-Box Group Problems
• Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
• SZK Proofs for Black-Box Group Problems
• SZK proofs for black-box group problems
• scientific article; zbMATH DE number 1284153
• scientific article; zbMATH DE number 1303114
• Low-complexity computations for nilpotent subgroup problems
• Breaking the \(n^{\log^n}\) barrier for solvable-group isomorphism

Cited in

(6)

• Solvable black-box group problems are low for PP
• The counting complexity of group-definable languages
• Solvable black-box group problems are low for \(\mathrm{PP}\)
• Counting Complexity of Solvable Black-Box Group Problems
• The size of SPP
• SZK proofs for black-box group problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370033)