Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Goldsmith, Judy"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of DNF minimization and isomorphism testing for monotone formulas
Judy Goldsmith
,
Matthias Hagen
,
Martin Mundhenk
Information and Computation
206
(6), 2008, pp. 760-775
Complexity of DNF and isomorphism of monotone formulas
Judy Goldsmith
,
Matthias Hagen
,
Martin Mundhenk
Lecture Notes in Computer Science
3618
, 2005, pp. 410-421
Tally
NP
sets and easy census functions
Judy Goldsmith
,
Mitsunori Ogihara
,
Jörg Rothe
Information and Computation
158
(1), 2000, pp. 29-52
More theory revision with queries
Judy Goldsmith
,
Robert H. Sloan
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 441-448
Complexity of finite-horizon Markov decision process problems
Martin Mundhenk
,
Judy Goldsmith
,
Christopher Lusena
,
Eric Allender
Journal of the ACM
47
(4), 2000, pp. 681-720
An algorithm for the class of pure implicational formulas
John Franco
,
Judy Goldsmith
,
John Schlipf
,
Ewald Speckenmeyer
,
R.P. Swaminathan
Discrete Applied Mathematics
96-97
, 1999, pp. 89-106
L
-printable sets
Lance Fortnow
,
Judy Goldsmith
,
Matthew A. Levy
,
Stephen Mahaney
SIAM Journal on Computing
28
(1), 1998, pp. 137-151
Complexity issues in Markov decision processes
Judy Goldsmith
,
Martin Mundhenk
Proceedings of the 13th Annual IEEE Conference on Computational Complexity (Buffalo, New York, June 15-18, 1998)
, 1998, pp. 272-280
Tally
NP
sets and easy census functions
Judy Goldsmith
,
Mitsunori Ogihara
,
Jörg Rothe
Lecture Notes in Computer Science
1450
, 1998, pp. 483-492
The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes
Martin Mundhenk
,
Judy Goldsmith
,
Eric Allender
Lecture Notes in Computer Science
1295
, 1997, pp. 129-138
L
-printable sets
Lance Fortnow
,
Judy Goldsmith
,
Matthew Levy
,
Stephen Mahaney
Proceedings of the 11th Annual IEEE Conference on Computational Complexity (Philadelphia, Pennsylvania, May 24-27, 1996)
, 1996, pp. 97-106
Scalability and the isomorphism problem
Judy Goldsmith
,
Steven Homer
Information Processing Letters
57
(3), 1996, pp. 137-143
Nondeterminism within
\P
Jonathan F. Buss
,
Judy Goldsmith
SIAM Journal on Computing
22
(3), 1993, June, pp. 560-572
Using self-reducibilities to characterize polynomial time
Judy Goldsmith
,
Deborah Joseph
,
Paul Young
Information and Computation
104
(2), 1993, June, pp. 288-308
A note on bi-immunity and
p
-closeness od
p
-cheatable sets in
P
/poly
Judy Goldsmith
,
Deborah Joseph
,
Paul Young
Journal of Computer and System Sciences
46
(3), 1993, pp. 349-362
Nondeterminism within P
Jonathan F. Buss
,
Judy Goldsmith
Lecture Notes in Computer Science
480
, 1991, pp. 348-359
Near-testable sets
Judy Goldsmith
,
Lane A. Hemachandra
,
Deborah Joseph
,
Paul Young
SIAM Journal on Computing
20
(3), 1991, June, pp. 506-523
On the structure and complexity of infinite sets with minimal perfect hash functions
Judy Goldsmith
,
Lane A. Hemachandra
,
Kenneth Kunen
Lecture Notes in Computer Science
560
, 1991, pp. 212-223
Using self-reducibilities to characterize polynomial time
Judy Goldsmith
,
Deborah Joseph
,
Paul Young
Technical Report (749), 1988
A note on bi-immunity abd P-closeness of P-cheatable sets in P/poly
Judy Goldsmith
,
Deborah Joseph
,
Paul Young
Technical Report (87-11-05), 1987, November
Self-reducible, P-selective, near-testable, and P-cheatable sets: The effect of internal structure on the complexity of a set
Judy Goldsmith
,
Deborah Joseph
,
Paul Young
Technical Report (87-06-02), 1987, June
Using self-reducibilities to characterize polynomial time
Judy Goldsmith
,
Deborah Joseph
,
Paul Young
Technical Report (87-11-11), 1987, November