Zobrazeno 1 - 10
of 37
pro vyhledávání: '"H B, Hunt"'
Publikováno v:
The Nebraska state medical journal. 31
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::8f3abe88db236e4ff88fa22a1e14bfcc
https://pubmed.ncbi.nlm.nih.gov/20995311
https://pubmed.ncbi.nlm.nih.gov/20995311
Autor:
H B, HUNT
Publikováno v:
The Nebraska state medical journal. 31
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::47e5631c127521f7b48798e7602c824c
https://pubmed.ncbi.nlm.nih.gov/20983906
https://pubmed.ncbi.nlm.nih.gov/20983906
Autor:
H B, HUNT
Publikováno v:
The American journal of roentgenology and radium therapy. 57(2)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::b854ef2e7637ad67f2b30532417ded7c
https://pubmed.ncbi.nlm.nih.gov/20288982
https://pubmed.ncbi.nlm.nih.gov/20288982
Autor:
H. B. Hunt, D. J. Rosenkrantz
Publikováno v:
Theoretical Studies in Computer Science
A number of results are presented on the complexity of structural equivalence and containment for context-free grammars. These results include the following: 1 Testing for any of a wide range of structural similarity relations for grammars, including
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbdeb4ee92f880a4909099c47597cca6
https://doi.org/10.1016/b978-0-12-708240-0.50009-5
https://doi.org/10.1016/b978-0-12-708240-0.50009-5
Autor:
D J Rosenkrantz, H B Hunt
Publikováno v:
SIAM Journal on Computing. 15:831-850
Deterministic exponential lower time bounds are presented for analyzing recursion schemes and recursive programs. The lower bounds for recursion schemes hold for any interpretation with a nontrivial predicate, i.e. a predicate that is neither identic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f51bb64470803ff4b42968a3cc914b05
https://doi.org/10.1137/0215059
https://doi.org/10.1137/0215059
Publikováno v:
The Journal of Nervous and Mental Disease. 85:274-282
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56b30286b19d07b3c422739138dc2187
https://doi.org/10.1097/00005053-193609000-00002
https://doi.org/10.1097/00005053-193609000-00002
Autor:
H B, Hunt
Publikováno v:
The Nebraska medical journal. 64(12)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::b5ea24a83ce58c9ed8cc7cc848907ea2
https://pubmed.ncbi.nlm.nih.gov/394007
https://pubmed.ncbi.nlm.nih.gov/394007
Publikováno v:
Obstetrics and gynecology. 43(6)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::062b1a9b3f4fc8d5e742fecb284f9af9
https://pubmed.ncbi.nlm.nih.gov/4829277
https://pubmed.ncbi.nlm.nih.gov/4829277
Autor:
H. B. Hunt, T. G. Szymanski
Publikováno v:
STOC
We present several techniques for proving lower bounds that can be applied to problems about grammars, formal languages, program schemes, simple programming languages, and automata. These techniques include dichotomization, extensions of dichotomizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35ca0b2148fae5273b87798b2b041289
https://doi.org/10.1145/800113.803640
https://doi.org/10.1145/800113.803640