Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Sarah Mocas"'
Publikováno v:
Communications of the ACM. 47:48-52
An Oregon police department successfully enlists tech-savvy citizens to serve as police reserve specialists.
Autor:
Sarah Mocas
Publikováno v:
Digital Investigation. 1:61-68
In order for technical research in digital forensics to progress a cohesive set of electronic forensics characteristics must be specified. To date, although the need for such a framework has been expressed, with a few exceptions, clear unifying chara
Autor:
Sarah Mocas
Publikováno v:
Theoretical Computer Science. 158(1-2):221-231
We are interested in separating classes in the exponential-time hierarchy, EXPH, from classes in the polynomial-time hierarchy, PH. In this paper we show that, for any fixed integer c, the class of sets accepted in deterministic polynomial time using
Autor:
Sarah Mocas, Luc Longpre
Publikováno v:
Information Processing Letters. 46:95-100
Symmetry of information (in Kolmogorov complexity) is a concept that comes out of formalizing the idea of how much information about a string y is contained in a string x. The situation is symmetric because it can be shown that the amount of informat
Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH
Autor:
Sarah Mocas
Publikováno v:
Structure in Complexity Theory Conference
We are interested in separating classes in the exponential time hierarchy, EXPH, from classes in the polynomial time hierarchy, PH. We show that for any fixed integer c, P/sup NP[O(n(c/)])/spl sube/NEXP. This improves a previous result by B. Fu, H. L
Autor:
Steven Homer, Sarah Mocas
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540602460
MFCS
MFCS
Lower bounds for the first levels of the exponential time hierarchy with respect to circuit and advice classes are studied. Using time bounded Kolmogorov complexity, languages are constructed which witness that various exponential time classes are no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fbf206c6f79b0017e18dcd80c5de3bb
https://doi.org/10.1007/3-540-60246-1_122
https://doi.org/10.1007/3-540-60246-1_122
Autor:
Sarah Mocas, E. Thomas Schubert
Publikováno v:
Higher Order Logic Theorem Proving and Its Applications ISBN: 9783540602750
TPHOLs
TPHOLs
Reasoning about key escrow protocols has increasingly become an important issue. The Escrowed Encryption Standard (EES) has been proposed as a US government standard for the encryption of unclassified telecommunications. One unique feature of this sy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3821524db9a5da522667a49ddcbfc328
https://doi.org/10.1007/3-540-60275-5_73
https://doi.org/10.1007/3-540-60275-5_73
Autor:
Sarah Mocas, Luc Longpre
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540549451
ISA
ISA
Symmetry of information (in Kolmogorov complexity) is a concept that comes out of formalizing the idea of how much information about a string y is contained in a string x. The situation is symmetric because it can be shown that the amount of informat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d3fe766dd3922ad0fa1d0918e5095a0
https://doi.org/10.1007/3-540-54945-5_75
https://doi.org/10.1007/3-540-54945-5_75