| Topics |
Views |
 |
|
Advertisements |
|
Algorithm and Complexity
Methods for solving problems on computers and the costs (usually the running time) of using those methods.
|
19768 |
|
An Introduction to Computing
Introduces the basics of the functional and imperative models of computation, recursive and iterative processes, and the basics of programming using higher-order functions. Uses Standard ML and Java as the programming languages.
|
13659 |
|
An Introduction to the Theory of Computation
This book explores terminologies and questions concerning programs, computers, problems, and computation. The exploration reduces in many cases to a study of mathematical theories, such as those of automata and formal languages.
|
23272 |
|
Approximation Algorithms
This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems.
|
6714 |
|
Combinatorial Algorithms
These lecture notes cover algorithms, especially combinatorial algorithms, with the main goal of creating correct and always-efficient ones.
|
20843 |
|
Complexity of Algorithms
These notes deal with the foundations of measuring the complexity of a problem, algorithm or structure used in computer science, the traditional branches of mathematics, statistical physics, biology, medicine, social sciences and engineering.
|
9314 |
|
Complexity Theory
These set of introductory notes give the broad picture of modern complexity theory, define the basic complexity classes and give some examples of each complexity class.
|
7007 |
|
Complexity Theory: A Modern Approach
A draft of a textbook on computational complexity theory. Covers basic complexity classes, lowerbounds for concrete computational models, and some advanced topics.
|
8791 |
|
Computation Complexity
These notes deal with the foundations of complexity theory for a one-semester graduate course. Part of it is also suitable for an undergraduate course, at a slower pace. Mathematical maturity is the main prerequisite.
|
6435 |
|
Computational Complexity: A Conceptual Perspective
Focuses on the high level study of computation, exploring the connections among computational problems and notions. Covers theory of NP-completeness, approximation, probabilistic proof systems, pseudorandomness and cryptography.
|
7234 |
|
Essentials of Metaheuristics
This is an open set of lecture notes on metaheuristics algorithms, a common but unfortunate name for any stochastic optimization algorithm intended to be the last resort before giving up and using random or brute-force search.
|
594 |
|
Essentials of Theoretical Computer Science
Covers the basics of the theory of computation and provides some of the tools used in program verification, translation and compiling, and the analysis of algorithms.
|
10849 |
|
Introduction to Complexity Theory
The notes are aimed at exposing the students to the basic results and research directions in the field of Complexity Theory. The focus was on concepts and ideas, and complex technical proofs were avoided.
|
9158 |
|
Introduction to Computational Complexity
Adopts some unconventional approaches, in which alternating Turing machines are introduced very early, and deterministic and nondeterministic Turing machines treated as special cases, in order to simplify many proofs.
|
8446 |
|
Lecture Notes on Algorithm Analysis and Computational Complexity (4th Edition)
Tranparency materials used in Algorithm Analysis and Complexity Theory course at the University of North Texas.
|
22063 |
|
Lecture Notes on Approximation Algorithms
Attempt to classify all hard optimization problems as one of the possibilities for relaxing the requirements, from the point of view of approximability: easy, intermediate and hard.
|
7355 |
|
Parallel Complexity Theory
The study of resource-bounded aimed at advanced graduate students or researchers in theoretical Computer Science.
|
14858 |
|
The Complexity of Boolean Functions
Presents a large number of research results on the complexity of Boolean functions in non-uniform computation models. It has a direct relevance to practical problems in the computer aided design of digital circuits.
|
8867 |
|
|
Advertisements |
