DEFINING SOFTWARE SCIENCE COUNTING STRATEGIESSALT NF.1982; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 3; PP. 58-67; BIBL. 11 REF.Article

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

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

MEASURES OF PARALLELISM IN ALTERNATING COMPUTATION TREESKING KN.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. 189-201; BIBL. 7 REF.Conference Paper

RECURSION AND COMPLEXITY THEORY ON CPO-SWEIHRAUCH K.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 195-202; BIBL. 15 REF.Conference Paper

STRAIGHT-LINE PROGRAM LENGTH AS A PARAMETER FOR COMPLEXITY ANALYSISLYNCH NA.1980; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1980; VOL. 21; NO 3; PP. 251-280; BIBL. 19 REF.Article

COMPLEXITY HIERARCHIES FOR BOOLEAN FUNCTIONSMCCOLL WF.1978; ACTA INFORMAT.; DEU; DA. 1978; VOL. 11; NO 1; PP. 71-77; BIBL. 14 REF.Article

A COMPLEXITY MEASURE.MCCABE TJ.1976; IN: INT. CONF. SOFTWARE ENG. 2. PROC.; SAN FRANCISCO; 1976; LONG BEACH; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 407Conference Paper

ON CELLULAR AUTOMATA WITH A FINITE NUMBER OF STATE CHANGESVOLLMAR R.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; SUPPL. 3; PP. 181-191; ABS. GER; BIBL. 5 REF.Article

REMARKS ON RECURSION VERSUS DIAGONALIZATION AND EXPONENTIALLY DIFFICULT PROBLEMSMACHTEY M; YOUNG P.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 442-453; BIBL. 9 REF.Article

SEVERAL RESULTS IN PROGRAM SIZE COMPLEXITYKATSEFF HP; SIPSER M.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 15; NO 3; PP. 291-309; BIBL. 18 REF.Article

SOME CONNECTIONS BETWEEN NONUNIFORM AND UNIFORM COMPLEXITY CLASSESKARP RM; LIPTON RJ.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 302-309; BIBL. 18 REF.Conference Paper

A TUERING MACHINE ORACLE HIERARCHY. IZAK S.1980; COMMENT. MATH. UNIV. CAROLINAE; CSK; DA. 1980; VOL. 21; NO 1; PP. 11-26; BIBL. 3 REF.Article