Narrow your search

Library

ULiège (3)

KU Leuven (2)

UHasselt (1)

ULB (1)

VUB (1)


Resource type

book (3)


Language

English (3)


Year
From To Submit

2009 (2)

2003 (1)

Listing 1 - 3 of 3
Sort by

Book
Computational complexity : a modern approach
Authors: ---
ISBN: 1139234757 1282390872 9786612390876 0511646445 0511804091 0511650531 0511532903 0511531990 0511533810 Year: 2009 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.

Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, August 24-26, 2003 proceedings
Authors: ---
ISBN: 3540451986 3540407707 Year: 2003 Publisher: Berlin, [Germany] ; Heidelberg, [Germany] : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.

Keywords

Computer Science --- Engineering & Applied Sciences --- Computer science --- Computer algorithms --- Statistical methods --- Informatics --- Computer science. --- Software engineering. --- Algorithms. --- Numerical analysis. --- Mathematical optimization. --- Computer Science. --- Software Engineering/Programming and Operating Systems. --- Optimization. --- Algorithm Analysis and Problem Complexity. --- Numeric Computing. --- Discrete Mathematics in Computer Science. --- Mathematics. --- Science --- Computer software. --- Electronic data processing. --- Computational complexity. --- Algorism --- Algebra --- Arithmetic --- Complexity, Computational --- Electronic data processing --- Machine theory --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Software, Computer --- Computer systems --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Computer software engineering --- Engineering --- Foundations --- Automation --- Computer science—Mathematics. --- Discrete mathematics. --- Software Engineering. --- Numerical Analysis. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis

Listing 1 - 3 of 3
Sort by