Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Relation binaire")

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 93

  • Page / 4
Export

Selection :

  • and

Procédé de construction des relations binaires non (< 3)-reconstructibles = A construction process of non-(≤ 3)-reconstructible binary relationsBOUDABBOUS, Y; LOPEZ, G.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1999, Vol 329, Num 10, pp 845-848, issn 0764-4442Article

Partial hyperclones on a finite setROMOV, B. A.Proceedings - International Symposium on Multiple-Valued Logic. 2002, pp 17-22, issn 0195-623X, isbn 0-7695-1462-6, 6 p.Conference Paper

Judgmental subtyping systems with intersection types and modal typesJEONGBONG SEO; SUNGWOO PARK.Acta informatica. 2013, Vol 50, Num 7-8, pp 359-380, issn 0001-5903, 22 p.Article

A formal library of set relations and its application to synchronous languagesROCHA, Camilo; MUNOZ, Cesar; DOWEK, Gilles et al.Theoretical computer science. 2011, Vol 412, Num 37, pp 4853-4866, issn 0304-3975, 14 p.Article

Pouvoir mesuré et capacité d'un électeur à influencer le résultat du vote = The measured power and the elector's capacity of influencing the voting outcomeDIFFO LAMBO, Lawrence; TCHANTCHO, Bertrand; MOULEN, Joël et al.Mathématiques et sciences humaines (2000). 2004, Num 166, pp 5-24, issn 0987-6936, 20 p.Article

Association schemes generated by a non-symmetric relation of valency 2HIRASAKA, M; MUZYCHUK, M.Discrete mathematics. 2002, Vol 244, Num 1-3, pp 109-135, issn 0012-365XConference Paper

Clôture transitive et reconstruction = Transitive closure and reconstructionBOUDABBOUS, Youssef; CHERIF, Bahri.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 2000, Vol 331, Num 1, pp 5-10, issn 0764-4442Article

Choice functions : Rationality re-examinedSUBIZA, B; PERIS, J. E.Theory and decision. 2000, Vol 48, Num 3, pp 287-304, issn 0040-5833Article

Relations infinies indécomposables critiques = Critically indecomposable infinite relationsRIGOLLET, L; THOMASSE, S.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1997, Vol 324, Num 3, pp 249-252, issn 0764-4442Article

ORDRES PERPENDICULAIRES = PERPENDICULAR ORDRESZaguia, Imed; Pouzet, Maurice.1997, 120 p.Thesis

La reconstruction au sens de Ulam de certaines multirelations binairesREVERDY-VILOTITCH, F.Discrete mathematics. 1991, Vol 93, Num 1, pp 89-95, issn 0012-365XArticle

On graph reasoningDE FREITAS, Renata; VELOSO, Paulo A. S; VELOSO, Sheila R. M et al.Information and computation (Print). 2009, Vol 207, Num 10, pp 1000-1014, issn 0890-5401, 15 p.Conference Paper

Batch processing with interval graph compatibilities between tasksFINKE, Gerd; JOST, Vincent; QUEYRANNE, Maurice et al.Discrete applied mathematics. 2008, Vol 156, Num 5, pp 556-568, issn 0166-218X, 13 p.Article

On the existence of maximal elements : An impossibility theoremKUKUSHKIN, Nikolai S.Discrete applied mathematics. 2008, Vol 156, Num 11, pp 1988-1993, issn 0166-218X, 6 p.Article

A characterization of concordance relationsBOUYSSOU, Denis; PIRLOT, Marc.European journal of operational research. 2005, Vol 167, Num 2, pp 427-443, issn 0377-2217, 17 p.Article

The minimal non-(≤k)-reconstructible relationsBOUDABBOUS, Youssef; LOPEZ, Gérard.Discrete mathematics. 2005, Vol 291, Num 1-3, pp 19-40, issn 0012-365X, 22 p.Article

What is reconstruction for ordered sets?RAMPON, Jean-Xavier.Discrete mathematics. 2005, Vol 291, Num 1-3, pp 191-233, issn 0012-365X, 43 p.Article

Dependences related to strict binary relationsHSIAO, H. K; YEH, Y. T; YU, S. S et al.Theoretical computer science. 2005, Vol 347, Num 1-2, pp 306-324, issn 0304-3975, 19 p.Article

Orbifolds, special varieties and classification theory: An appendixCAMPANA, Frédéric.Annales de l'Institut Fourier. 2004, Vol 54, Num 3, pp v-vi, issn 0373-0956, 37 p.Article

A partition-based approach towards constructing Galois (concept) latticesVALTCHEV, P; MISSAOUI, R; LEBRUN, P et al.Discrete mathematics. 2002, Vol 256, Num 3, pp 801-829, issn 0012-365X, 29 p.Conference Paper

On Goetschel and Voxman fuzzy matroidsNOVAK, Ladislav.Fuzzy sets and systems. 2001, Vol 117, Num 3, pp 407-412, issn 0165-0114Article

Mechanized operational semantics via (co)inductionAMBLER, S. J; CROLE, R. L.Lecture notes in computer science. 1999, pp 221-238, issn 0302-9743, isbn 3-540-66463-7Conference Paper

On rough relations : An alternative formulationYAO, Y. Y; TAO WANG.Lecture notes in computer science. 1999, pp 82-90, issn 0302-9743, isbn 3-540-66645-1Conference Paper

Structures de familles d'isomorphismes locaux et reconstructibilité = Structures of local isomorphisms and reconstructibilitySoro, Etienne-Tena; Lopez, Gerard.1997, 104 p.Thesis

On aggregation of T-transitive fuzzy binary relationsFODOR, J. C; OVCHINNIKOV, S.Fuzzy sets and systems. 1995, Vol 72, Num 2, pp 135-145, issn 0165-0114Article

  • Page / 4