Introduction to Autoreducibility and Mitoticity

Christian Glaßer,Dung T. Nguyen,Alan L. Selman,Maximilian Witek

Introduction to Autoreducibility and Mitoticity

2017

Christian Glaßer
Dung T. Nguyen
Alan L. Selman
Maximilian Witek

We survey results on these concepts, discover surprising similarities, and, in particular explain why autoreducibility might someday separate complexity classes.

Keywords:

True quantified Boolean formula
Discrete mathematics
Complexity class
Boolean function
Turing machine
Mathematics
Computer science
survey result
Theoretical computer science

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations