ABOUT COMPUTATIONAL COMPLEXITY

computational complexity 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 (with particular emphasis on lower bounds), complexity classes, trade-off results for sequential and parallel computation for "general" (Boolean) and "structured" computation (e.g. decision trees, arithmetic circuits) for deterministic, probabilistic, and nondeterministic computation worst case and average case

Legend

• 1016-3328
• 1420-8954^eISSN
• Computer Science,Mathematics
• SPRINGER BASEL AG
• Switzerland
• 1991-1996, 1998-2003, 2005-ongoing