AAAAAA

   
Results: 1-25 | 26-50 | 51-75 | 76-100 | >>

Table of contents of journal: *Mathematical systems theory

Results: 76-100/101
A NOTE ON POLYNOMIAL-SIZE CIRCUITS WITH LOW RESOURCE-BOUNDED KOLMOGOROV COMPLEXITY
Authors: HERMO M MAYORDOMO E
Citation: M. Hermo et E. Mayordomo, A NOTE ON POLYNOMIAL-SIZE CIRCUITS WITH LOW RESOURCE-BOUNDED KOLMOGOROV COMPLEXITY, Mathematical systems theory, 27(4), 1994, pp. 347-356
A NEW POLYNOMIAL-TIME ALGORITHM FOR THE MAXIMUM WEIGHTED (CHI(G) - 1)-COLORING PROBLEM IN COMPARABILITY-GRAPHS
Authors: HERTZ A
Citation: A. Hertz, A NEW POLYNOMIAL-TIME ALGORITHM FOR THE MAXIMUM WEIGHTED (CHI(G) - 1)-COLORING PROBLEM IN COMPARABILITY-GRAPHS, Mathematical systems theory, 27(4), 1994, pp. 357-363
STATISTICAL PROPERTIES OF FINITE SEQUENCES WITH HIGH KOLMOGOROV COMPLEXITY
Authors: LI M VITANYI PMB
Citation: M. Li et Pmb. Vitanyi, STATISTICAL PROPERTIES OF FINITE SEQUENCES WITH HIGH KOLMOGOROV COMPLEXITY, Mathematical systems theory, 27(4), 1994, pp. 365-376
GENERALIZED THEOREMS ON RELATIONSHIPS AMONG REDUCIBILITY NOTIONS TO CERTAIN COMPLEXITY CLASSES
Authors: OGIWARA M
Citation: M. Ogiwara, GENERALIZED THEOREMS ON RELATIONSHIPS AMONG REDUCIBILITY NOTIONS TO CERTAIN COMPLEXITY CLASSES, Mathematical systems theory, 27(3), 1994, pp. 189-200
AN OBSERVATION ON PROBABILITY VERSUS RANDOMNESS WITH APPLICATIONS TO COMPLEXITY CLASSES
Authors: BOOK RV LUTZ JH WAGNER KW
Citation: Rv. Book et al., AN OBSERVATION ON PROBABILITY VERSUS RANDOMNESS WITH APPLICATIONS TO COMPLEXITY CLASSES, Mathematical systems theory, 27(3), 1994, pp. 201-209
A FRAMEWORK FOR POLYNOMIAL-TIME QUERY LEARNABILITY
Authors: WATANABE O
Citation: O. Watanabe, A FRAMEWORK FOR POLYNOMIAL-TIME QUERY LEARNABILITY, Mathematical systems theory, 27(3), 1994, pp. 211-229
STRUCTURAL-ANALYSIS OF POLYNOMIAL-TIME QUERY LEARNABILITY
Authors: WATANABE O GAVALDA R
Citation: O. Watanabe et R. Gavalda, STRUCTURAL-ANALYSIS OF POLYNOMIAL-TIME QUERY LEARNABILITY, Mathematical systems theory, 27(3), 1994, pp. 231-256
ON THE COMPLEXITY OF GRAPH RECONSTRUCTION
Authors: KRATSCH D HEMASPAANDRA LA
Citation: D. Kratsch et La. Hemaspaandra, ON THE COMPLEXITY OF GRAPH RECONSTRUCTION, Mathematical systems theory, 27(3), 1994, pp. 257-273
COMPUTABILITY BY FINITE AUTOMATA AND PISOT BASES
Authors: BEREND D FROUGNY C
Citation: D. Berend et C. Frougny, COMPUTABILITY BY FINITE AUTOMATA AND PISOT BASES, Mathematical systems theory, 27(3), 1994, pp. 275-282
SOME RESULTS ON UNIFORM ARITHMETIC CIRCUIT COMPLEXITY
Authors: FRANDSEN GS VALENCE M BARRINGTON DAM
Citation: Gs. Frandsen et al., SOME RESULTS ON UNIFORM ARITHMETIC CIRCUIT COMPLEXITY, Mathematical systems theory, 27(2), 1994, pp. 105-124
ON COMPLETENESS FOR NP VIA PROJECTION TRANSLATIONS
Authors: STEWART IA
Citation: Ia. Stewart, ON COMPLETENESS FOR NP VIA PROJECTION TRANSLATIONS, Mathematical systems theory, 27(2), 1994, pp. 125-157
SEMANTICS OF TREES
Authors: EHRENFEUCHT A ROZENBERG G SALOMAA K
Citation: A. Ehrenfeucht et al., SEMANTICS OF TREES, Mathematical systems theory, 27(2), 1994, pp. 159-181
AN APPLICATION OF THE TRANSLATIONAL METHOD
Authors: FU B LI HZ ZHONG Y
Citation: B. Fu et al., AN APPLICATION OF THE TRANSLATIONAL METHOD, Mathematical systems theory, 27(2), 1994, pp. 183-186
ON THE CAPABILITIES OF SYSTOLIC SYSTEMS
Authors: EVEN S LITMAN A
Citation: S. Even et A. Litman, ON THE CAPABILITIES OF SYSTOLIC SYSTEMS, Mathematical systems theory, 27(1), 1994, pp. 3-28
PARALLEL ALGORITHMS FOR ROUTING IN NONBLOCKING NETWORKS
Authors: LIN G PIPPENGER N
Citation: G. Lin et N. Pippenger, PARALLEL ALGORITHMS FOR ROUTING IN NONBLOCKING NETWORKS, Mathematical systems theory, 27(1), 1994, pp. 29-40
AN APPROACH TO EMULATING SEPARABLE GRAPHS
Authors: OBRENIC B
Citation: B. Obrenic, AN APPROACH TO EMULATING SEPARABLE GRAPHS, Mathematical systems theory, 27(1), 1994, pp. 41-63
UNDERSTANDING RETIMING THROUGH MAXIMUM AVERAGE-DELAY CYCLES
Authors: PAPAEFTHYMIOU MC
Citation: Mc. Papaefthymiou, UNDERSTANDING RETIMING THROUGH MAXIMUM AVERAGE-DELAY CYCLES, Mathematical systems theory, 27(1), 1994, pp. 65-84
OPTIMAL SPEEDUP FOR BACKTRACK SEARCH ON A BUTTERFLY NETWORK
Authors: RANADE A
Citation: A. Ranade, OPTIMAL SPEEDUP FOR BACKTRACK SEARCH ON A BUTTERFLY NETWORK, Mathematical systems theory, 27(1), 1994, pp. 85-101
ON REDUCING THE NUMBER OF STACK SYMBOLS IN A PDA
Authors: GOLDSTINE J PRICE JK WOTSCHKE D
Citation: J. Goldstine et al., ON REDUCING THE NUMBER OF STACK SYMBOLS IN A PDA, Mathematical systems theory, 26(4), 1993, pp. 313-326
ON THE EFFECTIVE GENERATION OF SET ELEMENTS WITHIN SPECIFIED RANGES
Authors: SANCHIS LA
Citation: La. Sanchis, ON THE EFFECTIVE GENERATION OF SET ELEMENTS WITHIN SPECIFIED RANGES, Mathematical systems theory, 26(4), 1993, pp. 327-341
A MODEL OF SEQUENTIAL-COMPUTATION WITH PIPELINED ACCESS TO MEMORY
Authors: LUCCIO F PAGLI L
Citation: F. Luccio et L. Pagli, A MODEL OF SEQUENTIAL-COMPUTATION WITH PIPELINED ACCESS TO MEMORY, Mathematical systems theory, 26(4), 1993, pp. 343-356
COMPLEXITY ANALYSIS OF PROPOSITIONAL CONCURRENT PROGRAMS USING DOMINOTILING
Authors: YEN HC PAK N
Citation: Hc. Yen et N. Pak, COMPLEXITY ANALYSIS OF PROPOSITIONAL CONCURRENT PROGRAMS USING DOMINOTILING, Mathematical systems theory, 26(4), 1993, pp. 357-378
CONCISE REPRESENTATIONS OF REGULAR LANGUAGES BY DEGREE AND PROBABILISTIC FINITE AUTOMATA
Authors: KINTALA CMR PUN KY WOTSCHKE D
Citation: Cmr. Kintala et al., CONCISE REPRESENTATIONS OF REGULAR LANGUAGES BY DEGREE AND PROBABILISTIC FINITE AUTOMATA, Mathematical systems theory, 26(4), 1993, pp. 379-395
STATE-COMPLEXITY OF FINITE-STATE DEVICES, STATE COMPRESSIBILITY AND INCOMPRESSIBILITY
Authors: BIRGET JC
Citation: Jc. Birget, STATE-COMPLEXITY OF FINITE-STATE DEVICES, STATE COMPRESSIBILITY AND INCOMPRESSIBILITY, Mathematical systems theory, 26(3), 1993, pp. 237-269
ON THE DIAMETER AND BISECTOR SIZE OF CAYLEY-GRAPHS
Authors: ANNEXSTEIN F BAUMSLAG M
Citation: F. Annexstein et M. Baumslag, ON THE DIAMETER AND BISECTOR SIZE OF CAYLEY-GRAPHS, Mathematical systems theory, 26(3), 1993, pp. 271-291
Risultati: 1-25 | 26-50 | 51-75 | 76-100 | >>