Nondeterministics circuits, space complexity and quasigroups

DOI10.1016/0304-3975(92)00014-IzbMath0795.68074OpenAlexW1980865143MaRDI QIDQ1318692

Marty J. Wolf

Publication date: 5 April 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)00014-i

zbMATH Keywords

nondeterminismgroup isomorphism problemLatin square graph isomorphism problemLatin square isotopism problemnondeterministic complexity classesquasigroup isomorphism problem

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

On log-time alternating Turing machines of alternation depth k ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On nondeterminism in parallel computation
• Amounts of nondeterminism in finite automata
• On uniform circuit complexity
• Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
• On Relating Time and Space to Size and Depth
• Real-time computations with restricted nondeterminism
• On the n^{log n} isomorphism technique (A Preliminary Report)
• Parallelism in random access machines

This page was built for publication: Nondeterministics circuits, space complexity and quasigroups