scientific article; zbMATH DE number 1332670

DOI10.4086/CJTCS.1998.001MaRDI QIDQ4259991zbMATH OpenOpenAlexFDO

Authors Thomas Thierauf

Publication date 8 September 1999

Published in Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4086/cjtcs.1998.001

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1302479
• The computational complexity of equivalence and isomorphism problems
• On the isomorphism problem for some classes of computable algebraic structures
• A direct-sum theorem for read-once branching programs
• On the read-once property of branching programs and CNFs of bounded treewidth
• Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus
• A lower bound for read-once-only branching programs
• On the complexity of randomized read-once branching programs
• On arithmetic branching programs
• scientific article; zbMATH DE number 1335881

Cited in

(9)

• A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy
• Linear projections of the Vandermonde polynomial
• The complexity of equivalence and isomorphism of systems of equations over finite groups
• Isomorphism testing of read-once functions and polynomials
• Isomorphism testing of read-once functions and polynomials
• scientific article; zbMATH DE number 7559443 (Why is no real title available?)
• Determinant Equivalence Test over Finite Fields and over Q
• NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
• Testing equivalence to design polynomials

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 Q4259991)