DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Stephen Cook
Stephen Cook
Efficient Algorithms with Asymmetric Read and Write Costs
Great Ideas in Computing
Efficient Algorithms with Asymmetric Read and Write Costs
P Versus NP Richard M. Karp
The P Versus Np Problem
A Memorable Trip Abhisekh Sankaran Research Scholar, IIT Bombay
Alan Mathison Turing and the Turing Award Winners
Computability and Complexity
The Psychology of Invention in Computer Science
Laureates Meet Young Researchers in Heidelberg
DEPARTMENT of COMPUTER SCIENCE, University of Toronto
On Polynomial Time Approximation Bounded Solution for TSP and NP
Cook's Theory and Twentieth Century Mathematics
This Year from Kregel Academic
Jeff Ericsion
Joi160033.Pdf
Book Rev of Ideas That Created the Future
CS4102 Algorithms Spring 2020
Top View
Report to the Minister of Justice and Solicitor General Fatality Inquiries Act
Neural Networks and the Satisfiability Problem A
Problem A: Welcome Party
CS 4102: Algorithms Lecture 1: Introduction and Logistics
Proseminar Roots of Computer Science Introductory Meeting
Co-Authorship Proximity of A. M. Turing Award and John Von Neumann Medal Winners to the Disciplinary Boundaries of Computer Science
CECS 328 Lectures
Mathematical Logic in Computer Science
E Bibliography
Timeline of CS103 Results
History of Artificial Intelligence 1 History of Artificial Intelligence
Problem A: Welcome Party
Report to the Historical Resources Board
Zero Knowledge and the Department of Defense
NP-Completeness
P Vs NP Solution – Advances in Computational Complexity, Status and Future Scope
CS4102 Algorithms Spring 2019
Combinatorics, Complexity, and Randomness
The Millennium Prize Problems
Annual Report 2015 Message from Leadership
Examination 4
2015 Annual Report
A Prosopography of Turing Award Laureates (1966-2016) Camille Akmut
Conjunctive Predicate Transformers for Reasoning About Concurrent Computation
Reducibility Among Combinatorial Problems
Still Guarding Secrets After Years of Attacks, RSA Earns Accolades for Its Founders by Sara Robinson
The P Versus NP Problem
Acm Sigact, Ieee-Cs Award Knuth Prize to Co-Discoverer of Np- Completeness
Planar Graph Perfect Matching Is in NC
CS4102 Algorithms Fall 2019
On the Marriage of SPARQL and Keywords
A Prosopography of Turing Award Laureates (1966-2016)
The BBVA Foundation Bestows Its Award on the Architect of the First Machines Capable of Learning in the Same Way As the Human Brain
Near-Optimal Massively Parallel Graph Connectivity∗
The Ising Model: Teaching an Old Problem New Tricks