COMPILING SHORT-CIRCUIT BOOLEAN EXPRESSIONS IN ONE PASSLOGOTHETIS G; PRATEEK MISHRA.1981; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1981; VOL. 11; NO 11; PP. 1197-1214; BIBL. 8 REF.Article

COMMENT ON "AN OPTIMAL EVALUATION OF BOOLEAN EXPRESSIONS IN AN ONLINE QUERY SYSTEM"LAIRD PD.1979; COMMUNIC. A.C.M.; USA; DA. 1979; VOL. 22; NO 10; PP. 549-550; BIBL. 3 REF.Article

SOME INCONSISTENCIES IN PROGRAMMING LANGUAGE IMPLEMENTATIONSALVADORI A; DUMONT C.1979; SIGPLAN NOT.; USA; DA. 1979; VOL. 14; NO 11; PP. 107-109; BIBL. 1 REF.Article

CALCULATING THE PROBABILITY OF BOOLEAN EXPRESSION BEING 1.SCHNEEWEISS WG; BENNETTS RG; BROWN DB et al.1977; I.E.E.E. TRANS. RELIABIL.; U.S.A.; DA. 1977; VOL. 26; NO 1; PP. 16-22; BIBL. 12 REF.Article

OPTIMAL EVALUATION OF QUERIESPAPAKONSTANTINOU G.1982; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1982; VOL. 25; NO 2; PP. 239-241; BIBL. 9 REF.Article

AN ANALYSIS OF SOME FUZZY SUBSET APPLICATIONS TO INFORMATION RETRIEVAL SYSTEMSBUELL DA.1981; FUZZY SETS SYST.; ISSN 0165-0114; NLD; DA. 1981; VOL. 7; NO 1; PP. 35-42; BIBL. 8 REF.Article

A NOTE ON "AN OPTIMAL EVALUATION OF BOOLEAN EXPRESSIONS IN AN ONLINE QUERY SYSTEM"GUDES E; HOFFMAN A.1979; COMMUNIC. A.C.M.; USA; DA. 1979; VOL. 22; NO 10; PP. 550-553; BIBL. 7 REF.Article

A METHOD FOR THE SYNTAX DIRECTED DESIGN OF MULTIPROGRAMSCOLEMAN D; HUGHES JW; POWELL MS et al.1981; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1981; VOL. 7; NO 2; PP. 189-196; BIBL. 11 REF.Article

COUNTER-ONE-PASS FEATURES IN ONE-PASS COMPILATION: A FORMALIZATION USING ATTRIBUTE GRAMMARSGIEGERICH R; WILHELM R.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 6; PP. 279-284; BIBL. 3 REF.Article

RECOGNIZING DISGUISED NR(1) INSTANCES OF THE SATISFIABILITY PROBLEMASPVALL B.1980; J. ALGORITHMS; USA; DA. 1980; VOL. 1; NO 1; PP. 97-103; BIBL. 8 REF.Article

AN O(P(!SIGMA ! + !SIGMA !))-TIME FUNCTIONAL/MULTIVALUED DEFENDENCY MEMBERSHIP TESTING ALGORITHM BASED ON BOOLEAN RESOLUTIONLUK WK; DELOBEL C.1981; ; FRA; DA. 1981; IMAG-RR/260; 38 P.; 30 CM; BIBL. 2 P.;[RAPP. RECH. - LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR-260]Report

ON SOME DETERMINISTIC SPACE COMPLEXITY PROBLEMSHONG JIA WEI.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 310-317; BIBL. 9 REF.Conference Paper

COMMENTS ON A PAPER BY NEUHOLD AND STUDERPRITCHARD P.1979; COMPUTING; AUT; DA. 1979; VOL. 22; NO 3; PP. 279-282; ABS. GER; BIBL. 5 REF.Article

Hierarchical determination of precedence order and representation of digraphsINAGAKI, T; HIMMELBLAU, D. M.IEEE transactions on systems, man, and cybernetics. 1983, Vol 13, Num 3, pp 406-413, issn 0018-9472Article

SEA: A symbolic environment for automata theoryANDARY, Philippe; CARON, Pascal; CHAMPARNAUD, Jean-Marc et al.Lecture notes in computer science. 2001, pp 13-26, issn 0302-9743, isbn 3-540-42812-7Conference Paper

ON THE LIMIT OF FAMILIES OF ALGEBRAIC SUBVARIETIES WITH UNBOUNDED VOLUMECAMACHO, César; DE FIGUEIREDO, Luiz Henrique.Astérisque. 2009, Num 323, pp 41-59, issn 0303-1179, isbn 978-2-85629-263-1, 1Vol, 19 p.Conference Paper

Multiplication is the easiest nontrivial arithmetic functionALT, H.Theoretical computer science. 1985, Vol 36, Num 2-3, pp 333-339, issn 0304-3975Article

Solving satisfaibility in less than 2″ stepsMONIEN, B; SPECKENMEYER, E.Discrete applied mathematics. 1985, Vol 10, Num 3, pp 287-295, issn 0166-218XArticle

Alternating simple multihead finite automataMATSUN, H; INOUE, K; TANIGUCHI, H et al.Theoretical computer science. 1985, Vol 36, Num 2-3, pp 291-308, issn 0304-3975Article

Un algorithme de résolution du problème de disposition de sources pour les technologies = An algorithm to solve the problem of distribution of the resources for the technologiesBUI MINH TRI; NGUYEN DUC NGHIA; NGUYEN NGOC LAM et al.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 497. 1984, 13 p.Report

BOOLEAN CALCULUS OF DIFFERENCESTHAYSE A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 101; 151 P.; BIBL. 9 P.Serial Issue

Resolution for quantified Boolean formulasKLEINE BÜNING, H; KARPINSKI, M; FLÖGEL, A et al.Information and computation (Print). 1995, Vol 117, Num 1, pp 12-18, issn 0890-5401Article

On the learnability of monotone kμ-DNF formulae under product distributionsFLAMMINI, M.Information processing letters. 1994, Vol 52, Num 3, pp 167-173, issn 0020-0190Article

A c-version of minimal Boolean sum-of-product formsMITRA, A. K.Applied mathematics and computation. 1992, Vol 47, Num 2-3, pp 91-108, issn 0096-3003Article

Massively parallel switch-level simulation : a feasibility studyKRAVITZ, S. A; BRYANT, R. E; RUTENBAR, R. A et al.IEEE transactions on computer-aided design of integrated circuits and systems. 1991, Vol 10, Num 7, pp 871-894, issn 0278-0070Article