scientific article; zbMATH DE number 817509

zbMATH Open0837.68037MaRDI QIDQ4854879FDOQ4854879

Authors: Klaus Ambos-Spies, Dongping Yang 

Publication date: 16 November 1995

Title of this publication is not available (Why is that?)

Recommendations

• The polynomial method in circuit complexity applied to algorithm design (invited talk)
• scientific article; zbMATH DE number 3988707
• scientific article; zbMATH DE number 4078803
• Lower bounds for the complexity of polynomials
• scientific article; zbMATH DE number 4060720

zbMATH Keywords

delay diagonal methodeffective diagonal methodeffective finite extension methodgap methodpadding methodspeed up methodstructural polynomial complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (4)

• Nondiamond theorems for polynomial time reducibility
• Minimal pairs and complete problems
• A result relating disjunctive self-reducibility to P-immunity
• Diagonalizations over polynomial time computable sets

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