Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Logique booléenne")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1204

  • Page / 49
Export

Selection :

  • and

Boolean Satisfiability From Theoretical Hardness to Practical SuccessMALIK, Sharad; LINTAO ZHANG.Communications of the ACM. 2009, Vol 52, Num 8, pp 76-82, issn 0001-0782, 7 p.Article

Foundations of fuzzy sets : a nonstandard approachDROSSOS, C. A.Fuzzy sets and systems. 1990, Vol 37, Num 3, pp 287-307, issn 0165-0114, 21 p.Article

Soft evaluation of Boolean search queries in information retrieval systemsPAICE, C. D.Information technology: research and development. 1984, Vol 3, Num 1, pp 33-41Article

Generalized boolean methods of information retrievalRADECKI, T.International journal of man-machine studies. 1983, Vol 18, Num 5, pp 407-439, issn 0020-7373Article

Glushkov construction for multiplicitiesCARON, Pascal; FLOURET, Marianne.Lecture notes in computer science. 2001, pp 67-79, issn 0302-9743, isbn 3-540-42491-1Conference Paper

Optimal binary symmetric logic functions and their applicationsYAO LI; HA, B; EICHMANN, G et al.Optical engineering (Bellingham. Print). 1989, Vol 28, Num 4, pp 380-389, issn 0091-3286, 10 p.Article

End user boolean searching on viewdata using numeric keypadsPOLLITT, S.International online information meeting. 9. sd, pp 373-379Conference Paper

Exercises in quantifier manipulationBACKHOUSE, Roland; MICHAELIS, Diethard.Lecture notes in computer science. 2006, pp 69-81, issn 0302-9743, isbn 3-540-35631-2, 1Vol, 13 p.Conference Paper

Solving difficult SAT instances in the presence of symmetryALOUL, Fadi A; RAMANI, Arathi; MARKOV, Igor L et al.Design automation conference. 2002, pp 731-736, isbn 1-58113-461-4, 6 p.Conference Paper

Separating distribution-free and mistake-bound learning models over the Boolean domainBLUM, A. L.SIAM journal on computing (Print). 1994, Vol 23, Num 5, pp 990-1000, issn 0097-5397Article

Synthèse et optimisation temporelle de réseaux Booléens = Synthesis and timing optimization of Boolean networksSakouti, Khalid; Crastes De Paulet, André.1993, 155 p.Thesis

EMBEDDING THEOREMS FOR BOOLEAN ALGEBRAS AND CONSISTENCY RESULTS ON ORDINAL DEFINABLE SETS.STEPANEK P; BALCAR B.1977; J. SYMBOL. LOGIC; U.S.A.; DA. 1977; VOL. 42; NO 1; PP. 64-76; BIBL. 14 REF.Article

ON DECIDABILITY OF ONE CLASS OF BOOLEAN FORMULAS.MIJAJLOVIC Z.1974; MAT. VES.; JUGOSL.; DA. 1974; NO 11; PP. 48-54; BIBL. 2 REF.Article

Functionality of multilayer boolean neural networksAL-ALAWI, R; STONHAM, T. J.Electronics Letters. 1989, Vol 25, Num 10, pp 657-659, issn 0013-5194, 3 p.Article

De Boolese benadering bij geautomatiseerde gegevensopzœkingen: vooronderstellingen en kritiek = L'approche booléenne dans les recherches documentaires automatiques: hypothèses et critiquesROUSSEAU, R.Bibliotheek- en archiefgids - Vlaamse vereniging voor bibliotheek-, archief-, en documentatiewezen. 1986, Vol 62, Num 1, pp 67-73, issn 0772-7003Article

Association reducts : Boolean representationSLEZAK, Dominik.Lecture notes in computer science. 2006, pp 305-312, issn 0302-9743, isbn 3-540-36297-5, 1Vol, 8 p.Conference Paper

Efficient recovery of secretsFEMANDEZ, Marcel; SORIANO, Miguel.International conference on information technology. 2004, isbn 0-7695-2108-8, 2Vol, vol2, 763-767Conference Paper

Optical implementation of multiple-valued and continuous logicsMADA, H.Japanese journal of applied physics. 1990, Vol 29, Num 7, pp L1290-L1292, issn 0021-4922, 2Article

A REASSESSMENT OF GEORGE BOOLE'S THEORY OF LOGIC.VAN EVRA JW.1977; NOTRE DAME J. FERM. LOGIC; U.S.A.; DA. 1977; VOL. 18; NO 3; PP. 363-377; BIBL. 1 P.Article

ON NACHBIN'S CHARACTERIZATION OF A BOOLEAN LATTICE.CORNISH WH.1976; NOTRE DAME J. FORM. LOGIC; U.S.A.; DA. 1976; VOL. 17; NO 1; PP. 155-157; BIBL. 7 REF.Article

STRUKTURSAETZE DER ALGEBRA UND KOMPLIZIERTHEIT LOGISCHER SCHEMATA. I. BOOLESCHE ALGEBREN. = THEOREME DE STRUCTURE DES ALGEBRES ET DES SCHEMAS LOGIQUES COMPLEXES. I. ALGEBRE BOOLEENNEHOEHNKE HJ.1974; MATH. NACHR.; DTSCH.; DA. 1974; VOL. 61; PP. 15-35Article

A complete set of transformation rules for quantum Boolean circuits with CNOT gatesIWAMA, Kazuo; YAMASHITA, Shigeru.Superlattices and microstructures. 2002, Vol 31, Num 2-4, pp 181-192, issn 0749-6036Conference Paper

Describing parameterized complexity classesFLUM, Jorg; GROHE, Martin.Lecture notes in computer science. 2002, pp 359-371, issn 0302-9743, isbn 3-540-43283-3Conference Paper

Looking algebraically at tractable quantified boolean formulasHUBIE CHEN; DALMAU, Victor.Lecture notes in computer science. 2005, pp 71-79, issn 0302-9743, isbn 3-540-27829-X, 9 p.Conference Paper

New cryptographic primitives based on multiword T-functionsKLIMOV, Alexander; SHAMIR, Adi.Lecture notes in computer science. 2004, pp 1-15, issn 0302-9743, isbn 3-540-22171-9, 15 p.Conference Paper

  • Page / 49