AAAAAA

   
Results: 1-8 |
Results: 8
INFORMATION CAPACITY OF BINARY WEIGHTS ASSOCIATIVE MEMORIES
Authors: JAGOTA A NARASIMHAN G REGAN KW
Citation: A. Jagota et al., INFORMATION CAPACITY OF BINARY WEIGHTS ASSOCIATIVE MEMORIES, Neurocomputing, 19(1-3), 1998, pp. 35-58
PARAMETERIZED CIRCUIT COMPLEXITY AND THE W-HIERARCHY
Authors: DOWNEY RG FELLOWS MR REGAN KW
Citation: Rg. Downey et al., PARAMETERIZED CIRCUIT COMPLEXITY AND THE W-HIERARCHY, Theoretical computer science, 191(1-2), 1998, pp. 97-115
GAP-LANGUAGES AND LOG-TIME COMPLEXITY CLASSES
Authors: REGAN KW VOLLMER H
Citation: Kw. Regan et H. Vollmer, GAP-LANGUAGES AND LOG-TIME COMPLEXITY CLASSES, Theoretical computer science, 188(1-2), 1997, pp. 101-116
INDEX SETS AND PRESENTATIONS OF COMPLEXITY CLASSES
Authors: REGAN KW
Citation: Kw. Regan, INDEX SETS AND PRESENTATIONS OF COMPLEXITY CLASSES, Theoretical computer science, 161(1-2), 1996, pp. 263-287
LINEAR-TIME AND MEMORY-EFFICIENT COMPUTATION
Authors: REGAN KW
Citation: Kw. Regan, LINEAR-TIME AND MEMORY-EFFICIENT COMPUTATION, SIAM journal on computing, 25(1), 1996, pp. 133-168
ON QUASI-LINEAR-TIME COMPLEXITY THEORY
Authors: NAIK AV REGAN KW SIVAKUMAR D
Citation: Av. Naik et al., ON QUASI-LINEAR-TIME COMPLEXITY THEORY, Theoretical computer science, 148(2), 1995, pp. 325-349
ON CLOSURE-PROPERTIES OF BOUNDED 2-SIDED ERROR COMPLEXITY CLASSES
Authors: REGAN KW ROYER JS
Citation: Kw. Regan et Js. Royer, ON CLOSURE-PROPERTIES OF BOUNDED 2-SIDED ERROR COMPLEXITY CLASSES, Mathematical systems theory, 28(3), 1995, pp. 229-243
THE POWER OF THE MIDDLE BIT OF A P-FUNCTION
Authors: GREEN F KOBLER J REGAN KW SCHWENTICK T TORAN J
Citation: F. Green et al., THE POWER OF THE MIDDLE BIT OF A P-FUNCTION, Journal of computer and system sciences, 50(3), 1995, pp. 456-467
Risultati: 1-8 |