Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Lógica booleana")


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


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 1123

  • Page / 45

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

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

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

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

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

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

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

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

Lemma and model caching in decision procedures for quantified Boolean formulasLETZ, Reinhold.Lecture notes in computer science. 2002, pp 160-175, issn 0302-9743, isbn 3-540-43929-3, 16 p.Conference Paper

QuBE : A system for deciding quantified boolean formulas satisfiabilityGIUNCHIGLIA, Enrico; NARIZZANO, Massimo; TACCHELLA, Armando et al.Lecture notes in computer science. 2001, pp 364-369, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Use of electron trapping materials in optical signal processing. I, Parallel Boolean logicJUTAMULIA, S; STORTI, G. M; LINDMAYER, J et al.Applied optics. 1990, Vol 29, Num 32, pp 4806-4811, issn 0003-6935Article

An extension of logic functions on the quaternary Boolean ringNAKAO, Z.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1986, Vol 69, Num 11, pp 1169-1172, issn 0387-236XArticle

Poly-logarithmic Independence Fools Bounded-Depth Boolean CircuitsBRAVERMAN, Mark.Communications of the ACM. 2011, Vol 54, Num 4, pp 108-115, issn 0001-0782, 8 p.Article

Calcul du coefficient de préparation d'un système complexe à éléments non homogènes dans le cas de restauration limitéeGAGIN, A. A; NARYSHKINA, T. S.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1987, Num 4, pp 99-105, issn 0002-3388Article

Boole's logic and probability: a critical exposition from the standpoint of contemporary algebra, logic and probability theory. Second edition, revised and enlargedHAILPERIN, T.Studies in logic and the foundations of mathematics. 1986, Vol 85, issn 0049-237X, XII-428 pSerial Issue

Dawn of next generation information retrievalMUHLHAUSER, G.International online information meeting. 9. sd, pp 365-371Conference Paper

Formal verification of infinite state systems using boolean methodsBRYANT, Randal E.Lecture notes in computer science. 2006, pp 1-3, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 3 p.Conference Paper

  • Page / 45