Browsing CS Technical Reports by Author "Goldsmith, Judy"
Now showing items 1-5 of 5
-
Near-Testable Sets
Goldsmith, Judy; Hemachandra, Lane; Joseph, Deborah A; Young, Paul (University of Wisconsin-Madison Department of Computer Sciences, 1988) -
A Note on Bi-Immunity and P-Closeness of P-Cheatable Sets in P/poly
Goldsmith, Judy; Joseph, Deborah A; Young, Paul (University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Polynomial Isomorphisms and Near-Testable Sets
Goldsmith, Judy (University of Wisconsin-Madison Department of Computer Sciences, 1989) -
Self-Reducible, P-selective, Near-testable, and P-cheatable Sets: The Effect of Internal Structure on the Complexity of a Set
Goldsmith, Judy; Joseph, Deborah A; Young, Paul (University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Using Self-Reducibilities to Characterize Polynomial Time
Goldsmith, Judy; Joseph, Deborah A; Young, Paul (University of Wisconsin-Madison Department of Computer Sciences, 1988)