A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Robust Simulations and Significant Separations
[chapter]

2011
*
Lecture Notes in Computer Science
*

We define and study a new notion of "robust simulations" between complexity classes which is intermediate between the traditional notions of infinitely-often and almost-everywhere, as well as a corresponding notion of "significant separations". A language L has a robust simulation in a complexity class C if there is a language in C which agrees with L on arbitrarily large polynomial stretches of input lengths. There is a significant separation of L from C if there is no robust simulation of L ∈

doi:10.1007/978-3-642-22006-7_48
fatcat:okkkx5sudrb5xc34fsf3uf5v44