English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Catching the k-NAESAT Threshold

Panagiotou, K., & Coja-Oghlan, A. (2012). Catching the k-NAESAT Threshold. In STOC'12 (pp. 899-907). New York, NY: ACM.

Item is

Basic

show hide
Genre: Conference Paper
Latex : Catching the k-{NAESAT} Threshold

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Panagiotou, Konstantinos1, Author           
Coja-Oghlan, Amin2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2012
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1145/2213977.2214058
BibTex Citekey: ACO-P2012
Other: Local-ID: 19FE722E23BE4145C1257ACD0051823E-ACO-P2012
 Degree: -

Event

show
hide
Title: ACM Symposium on Theory of Computing
Place of Event: New York, NY
Start-/End Date: 2012-05-19 - 2012-05-22

Legal Case

show

Project information

show

Source 1

show
hide
Title: STOC'12
  Abbreviation : STOC 2012
  Subtitle : Proceedings of the 2012 ACM Symposium on Theory of Computing
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 899 - 907 Identifier: ISBN: 978-1-4503-1245-5