Return to JournalSeek Home

Genamics JournalSeek

Computational Complexity
Comput Complex

Published/Hosted by Springer. ISSN (printed): 1016-3328. ISSN (electronic): 1420-8954.

Computational Complexity (CC) presents outstanding research in computational complexity. Its subject is at the interface between mathematics and theoretical computer science with a clear mathematical profile and strictly mathematical format. The central topics are: Models of computation complexity bounds complexity classes trade-off results - for sequential and parallel computation - for «general» (Boolean) and «structured» computation - for deterministic probabilistic and nondeterministic computation Specific areas of concentration include: Structure of complexity classes Algebraic complexity Cryptography interactive proofs Complexity issues in - computational geometry robotics and motion planning - learning theory - number theory - logic - combinatorial optimization and approximate solutions - distributed computing

   Further information
   Category Links








Add To Favorites
Email This Page



Side Panel
Privacy Policy About Us Contact Us