The conference seeks original research papers in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. We also encourage contributions from other areas of computer science and mathematics motivated by questions in complexity theory. Possible topics include but are not limited to:

 

Topics    

• Complexity classes
  
• Reducibility and completeness
  
• Circuit complexity
  
• Communication complexity
  
• Complexity in other discrete models
  
• Algebraic complexity
  
• Proof complexity
  
• Interactive and probabilistic proof systems
  
• Logic and descriptive complexity
  
• Pseudorandomness and derandomization
  
• Average case complexity

Submission Deadline    : January 24, 2018 Authors Notification     :  April 4, 2018 Final Manuscript Due    : April 16, 2018

 

User Name : ruffil
Posted 06-11-2017 on 16:38:07 AEDT

Related CFPs

GRAPH-HOC   International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
CIRSY 2026   12th International Conference on Circuits and Systems
AE 2026   10th International Conference on Advances in Engineering (AE 2026)
CIRSY 2026   12th International Conference on Circuits and Systems