REDUCING MODEL COMPLEXITY IN SYSTEM DESIGNKOOMEN CJ.1979; ICCS 79. INTERNATIONAL CONFERENCE ON CYBERNETICS AND SOCIETY/1979/DENVER CO; USA; NEW YORK: IEEE; DA. 1979; PP. 830-833; BIBL. 11 REF.Conference Paper

THE ENTROPIC LIMITATIONS ON VLSI COMPUTATIONSYAO AC.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 308-311; BIBL. 16 REF.Conference Paper

LOWER BOUNDS FOR VLSILIPTON RJ; SEDGENICK R.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 300-307; BIBL. 11 REF.Conference Paper

COMPUTING LOWER BOUNDS ON TENSOR RANK OVER FINITE FIELDSLASKOWSKI SJ.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 1-14; BIBL. 15 REF.Article

ON COMPLEXITY AND SYNTACTIC INFORMATIONBOEKEE DE; KRAAK RA; BACKER E et al.1982; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1982; VOL. 12; NO 1; PP. 71-79; BIBL. 11 REF.Article

ON THE EMULATION OF FLOWCHARTS BY DECISION TABLESLEW A.1982; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 12; PP. 895-905; BIBL. 16 REF.Article

ACCESSIBILITY OF VALUES AS A DETERMINANT OF RELATIVE COMPLEXITY IN ALGEBRASLYNCH NA.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 101-113; BIBL. 5 REF.Article

SOFTWARE QUALITY METRICS BASED ON INTERCONNECTIVITYKAFURA D; HENRY S.1981; J. SYST. SOFTW.; ISSN 0164-1212; USA; DA. 1981; VOL. 2; NO 2; PP. 121-131; BIBL. 15 REF.Article

THE DEPTH OF MONOTONE BOOLEAN FUNCTIONS WITH MULTI INPUT "AND" AND "OR" GATESKEKRE HB; SAHASRABUDHE SC; RAMA RAO V et al.1981; COMPUT. ELECTR. ENG.; ISSN 0045-7906; USA; DA. 1981; VOL. 8; NO 4; PP. 289-291; BIBL. 3 REF.Article

A MODEL OF COMPUTATION FOR VLSI WITH RELATED COMPLEXITY RESULTSCHAZELLE B; MONIER L.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 318-325; BIBL. 14 REF.Conference Paper

FIRST-YEAR RESULTS FROM A RESEARCH PROGRAM ON HUMAN FACTORS IN SOFTWARE ENGINEERINGSHEPPARD SB; CURTIS B; MILLIMAN P et al.1979; NATIONAL COMPUTER CONFERENCE/1979/NEW YORK NY; USA; MONTVALE: AFIPS PRESS; DA. 1979; PP. 1021-1027; BIBL. 25 REF.Conference Paper

LENGTH OF PREDICATE CALCULUS FORMULAS AS A NEW COMPLEXITY MEASUREIMMERMAN N.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 337-347; BIBL. 15 REF.Conference Paper

ON THE SIMPLIFICATION OF CONSTRUCTIONS IN DEGREES OF INSOLVABILITY VIA COMPUTATIONAL COMPLEXITYDALEY RP.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 258-265; BIBL. 8 REF.Conference Paper

TOWARDS A PRECISE CHARACTERIZATION OF THE COMPLEXITY OF UNIVERSAL AND NONUNIVERSAL TURING MACHINESPRIESE L.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 508-523; BIBL. 16 REF.Article

A CROSSING MEASURE FOR 2-TAPE TURING MACHINESWECHSUNG G.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 508-516; BIBL. 3 REF.Conference Paper

ON THE SUBWORD COMPLEXITY OF LOCALLY CATENATIVE DOL LANGUAGESEHRENFEUCHT A; ROZENBERG G.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 1; PP. 7-9; BIBL. 6 REF.Article

LOWER BOUNDS FOR ALGEBRIC DECISION TREESSTEELE JM; YAO AC.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 1; PP. 1-8; BIBL. 17 REF.Article

THE COMPLEXITY OF MAINTAINING AN ARRAY AND COMPUTING ITS PARTIAL SUMSFREDMAN ML.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 1; PP. 250-260; BIBL. 4 REF.Article

A LOWER BOUND FOR THE FORMULA SIZE OF RATIONAL FUNCTIONSKALORKOTI KA.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 330-338; BIBL. 6 REF.Conference Paper

A NESTING LEVEL COMPLEXITY MEASUREPINOWARSKI P.1982; SIGPLAN NOTICES; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 9; PP. 44-50; BIBL. 12 REF.Article

MEASURING THE QUALITY OF STRUCTURAL DESIGNSTROY DA; ZWEBEN SH.1981; J. SYST. SOFTW.; ISSN 0164-1212; USA; DA. 1981; VOL. 2; NO 2; PP. 113-120; BIBL. 10 REF.Article

NEW MEASURES OF TESTABILITY AND TEST COMPLEXITY FOR LINEAR ANALOG FAILURE ANALYSISPRIESTER RW; CLARY JB.1981; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 11; PP. 884-888; BIBL. 18 REF.Article

STUDY OF SEVERAL METRICS FOR PROGRAMMING EFFORTWOODFIELD SN; SHEN VY; DUNSMORE HE et al.1981; J. SYST. SOFTW.; ISSN 0164-1212; USA; DA. 1981; VOL. 2; NO 2; PP. 97-103; BIBL. 14 REF.Article

WIDTH AND DEPTH OF COMBINATIONAL LOGIC CIRCUITSYASUURA H.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 191-194; BIBL. 7 REF.Article

A NEW HEURISTIC FOR INFERRING REGULAR GRAMMARSITOGA SY.1981; I.E.E.E. TRANS. PATTERN ANAL. MACH. INTELL.; USA; DA. 1981; VOL. 3; NO 2; PP. 191-197; BIBL. 9 REF.Article