scientific article; zbMATH DE number 5937160

MaRDI QIDQ5198626zbMATH OpenFDO

Authors

Publication date 9 August 2011

Full work available at URL http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5497049

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Recommendations

• scientific article; zbMATH DE number 5937218
• Special issue: Conference on computational complexity (CCC 2010). Selected papers based on the presentations at the 25th annual IEEE conference, Cambridge, MA, USA, June 9--11, 2010
• scientific article; zbMATH DE number 5729463
• scientific article; zbMATH DE number 5729452
• scientific article; zbMATH DE number 5729464
• scientific article; zbMATH DE number 5729451
• scientific article; zbMATH DE number 6456550
• scientific article; zbMATH DE number 5719137
• scientific article; zbMATH DE number 6456551
• Special issue: Selected papers from the 19th annual IEEE conference on computational complexity (CCC 2004), Amherst, MA, USA, June 21--24, 2004

Cited in

(14)

• Computational complexity theory. Part 10. Transl. from the Russian.
• Special issue: Selected papers from the 19th annual IEEE conference on computational complexity (CCC 2004), Amherst, MA, USA, June 21--24, 2004
• scientific article; zbMATH DE number 5729452 (Why is no real title available?)
• scientific article; zbMATH DE number 5729464 (Why is no real title available?)
• Solution of the propeller conjecture in R^3
• scientific article; zbMATH DE number 1309064 (Why is no real title available?)
• Lower bounds for linear decision lists
• Non-unique games over compact groups and orientation estimation in cryo-EM
• Anchored parallel repetition for nonlocal games
• The power of linear programming for general-valued CSPs
• scientific article; zbMATH DE number 6456550 (Why is no real title available?)
• Efficient algorithms for the Potts model on small-set expanders
• Stability of homomorphisms, coverings and cocycles. I: Equivalence
• Proceedings of the fifth international workshop on implicit computational complexity, held in conjunction with LICS in Ottawa, ON, Canada, June 26--27, 2003

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