20 search results - page 2 / 4 » focs 1997 |
123
Voted
FOCS
1997
IEEE
15 years 8 months ago
1997
IEEE
133
Voted
FOCS
1997
IEEE
15 years 8 months ago
1997
IEEE
118
Voted
FOCS
1997
IEEE
15 years 9 months ago
1997
IEEE
145
click to vote
FOCS
1997
IEEE
15 years 9 months ago
1997
IEEE
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...