Back to Results
First PageMeta Content
Complexity classes / NP / P versus NP problem / Randomized algorithm / PP / Random self-reducibility / RP / P / Normal distribution / Theoretical computer science / Computational complexity theory / Applied mathematics


Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 4 25 March 1999 ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,
Add to Reading List

Document Date: 1999-04-30 15:06:50


Open Document

File Size: 436,74 KB

Share Result on Facebook

City

Las Vegas / Monte Carlo / Cambridge / /

Company

Chicago Journal / NP 7 Chicago Journal / Proposition 1 2 8 Chicago Journal / G 6 Chicago Journal / Generating Test Instances (Info) The Chicago Journal / /

Country

United States / /

Currency

pence / /

/

Facility

The Massachusetts Institute of Technology / Five Cambridge Center / /

IndustryTerm

probabilistic polynomial-time bounded algorithm / on-average algorithm / probabilistic algorithm / probabilistic polynomial-time algorithm / search problem / search problems / polynomial-time algorithms / given algorithm / trivial search problems / /

Organization

MIT / Massachusetts Institute of Technology / Five Cambridge Center / /

Person

Joseph Halpern / Gil Neiger David Peleg Andrew / Stephen Brookes Jin-Yi / Maurice Herlihy Ted Herman Stephen / Eric Allender / Herman Stephen Homer Neil / Pankaj Agarwal Eric Allender Tetsuo / Rainer Schuler / Philip Klein Phokion Kolaitis Stephen / Georg Gottlob Vassos Hadzilacos Juris / Eric Allender Tetsuo Asano Laszl / Stephen Mahaney Michael Merritt John / Jin-Yi Cai Anne Condon Cynthia Dwork David / Steven Fortune Greg Frederickson Andrew Goldberg Georg / Eric Bach Stephen Brookes / Merritt John Mitchell Ketan / Stephen Homer Neil Immerman Howard Karloff Philip / John Mitchell Ketan Mulmuley Gil Neiger David / Howard Karloff Philip Klein Phokion / Ted Herman Stephen Homer / Stuart A. Kurtz / Michael Merritt John Mitchell / Andrew Goldberg Georg Gottlob Vassos / Juris Hartmanis Maurice Herlihy Ted / David Eppstein Ronald Fagin Lance / Martin Abadi Pankaj Agarwal Eric / Christoph Karg Johannes / Cynthia Dwork David Eppstein Ronald / Ronald Fagin Lance Fortnow Steven / Sam Toueg Moshe Vardi Jennifer / James Royer Alan Selman Nir / /

/

Position

RT / Subsidiary Rights Manager / Editor-in-Chief / Managing Editor / /

ProgrammingLanguage

R / K / /

ProvinceOrState

Massachusetts / /

PublishedMedium

The Chicago Journal / Theoretical Computer Science / Lecture Notes in Computer Science / /

Technology

polynomial-time algorithms / probabilistic algorithm / probabilistic polynomial-time bounded algorithm / given algorithm / on-average algorithm / probabilistic polynomial-time algorithm / following probabilistic algorithm / /

URL

ftp /

SocialTag