Genamics JournalSeek
Computational Complexity
Comput Complex
Published/Hosted by Springer.
ISSN (printed): 10163328. ISSN (electronic): 14208954.
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 tradeoff 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
