Back to Results
First PageMeta Content
Complexity classes / Structural complexity theory / Mathematical optimization / Probabilistic complexity theory / NP / PP / Polynomial hierarchy / PSPACE-complete / P versus NP problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Autoreducibility, Mitoticity, and Immunity Christian Glaßer∗, Mitsunori Ogihara†, A. Pavan‡, Alan L. Selman§, Liyu Zhang¶ December 27, 2004 Abstract We show the following results regarding complete sets.
Add to Reading List

Document Date: 2004-12-27 11:32:14

Open Document

File Size: 752,23 KB

Share Result on Facebook

Company

L. / /

Currency

pence / /

/

Facility

Iowa State University / University of Rochester / /

IndustryTerm

deterministic algorithm / easy binary search / binary search / /

Organization

National Institute of Health / Iowa State University / University of Rochester / National Science Foundation / Department of Computer Science / /

Person

Alan L. Selman / /

/

Position

rt / ≤pm / A≤pm / Prime Minister / /

Technology

deterministic algorithm / The algorithm / /

SocialTag