To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

How to transfigure the Wikipedia

Would you like Wikipedia to always look as professional and up-to-date? We have created a browser extension. It will enhance any encyclopedic page you visit with the magic of the WIKI 2 technology.

Try it — you can delete it anytime.

Install in 5 seconds
4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
Great Wikipedia has got greater.
.
Leo
Newton
Brights
Milds

Michael Garey

From Wikipedia, the free encyclopedia

Michael Garey
Born
Michael Randolph Garey

(1945-11-19) November 19, 1945 (age 78)
Manitowoc, Wisconsin, U.S.
NationalityAmerican
Alma materUniversity of Wisconsin–Madison
Scientific career
FieldsComputer science

Michael Randolph Garey (born November 19, 1945) is a computer science researcher, and co-author (with David S. Johnson) of Computers and Intractability: A Guide to the Theory of NP-completeness. He and Johnson received the 1979 Frederick W. Lanchester Prize from the Operations Research Society of America for the book. Garey earned his PhD in computer science in 1970 from the University of Wisconsin–Madison.[1] He was employed by AT&T Bell Laboratories in the Mathematical Sciences Research Center from 1970 until his retirement in 1999. For his last 11 years with the organization, he served as its director. His technical specialties included discrete algorithms and computational complexity, approximation algorithms, scheduling theory, and graph theory. From 1978 until 1981 he served as Editor-in-Chief of the Journal of the Association for Computing Machinery. In 1995, Garey was inducted as a Fellow of the Association for Computing Machinery.[2]

YouTube Encyclopedic

  • 1/3
    Views:
    16 584
    651
    75 145
  • P=NP?
  • P, NP and Proof Complexity
  • 1. Overview

Transcription

References

  1. ^ "The Mathematics Genealogy Project: Michael Randolph Garey".
  2. ^ "ACM: Fellows Award / Michael R Garey". Association for Computing Machinery. Retrieved 2009-01-24.

External links


P ≟ NP 

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

This page was last edited on 9 March 2024, at 01:49
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.
Contact WIKI 2
Introduction
Terms of Service
Privacy Policy