default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYves Crama
- > Home > Persons > Yves Crama
Publications
- 2013
[j45]Yves Crama, Peter L. Hammer:
Boolean Functions. Discret. Appl. Math. 161(1-2): 315 (2013)- 2011
- [b1]Yves Crama, Peter L. Hammer:
Boolean Functions - Theory, Algorithms, and Applications. Encyclopedia of mathematics and its applications 142, Cambridge University Press 2011, ISBN 978-0-521-84751-3, pp. I-XXI, 1-687 - [j42]Endre Boros
, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
Logical analysis of data: classification with justification. Ann. Oper. Res. 188(1): 33-61 (2011) - 2010
- [p17]Reinhard Pöschel, Ivo G. Rosenberg, Yves Crama, Peter L. Hammer:
Compositions and Clones of Boolean Functions. Boolean Models and Methods 2010: 3-38 - [p16]Jan C. Bioch, Yves Crama, Peter L. Hammer:
Decomposition of Boolean Functions. Boolean Models and Methods 2010: 39-76 - [p15]Alasdair Urquhart, Yves Crama, Peter L. Hammer:
Proof Theory. Boolean Models and Methods 2010: 79-98 - [p14]John Franco, Yves Crama, Peter L. Hammer:
Probabilistic Analysis of Satisfiability Algorithms. Boolean Models and Methods 2010: 99-159 - [p13]John N. Hooker, Yves Crama, Peter L. Hammer:
Optimization Methods in Logic. Boolean Models and Methods 2010: 160-194 - [p12]Martin Anthony, Yves Crama, Peter L. Hammer:
Probabilistic Learning and Boolean Functions. Boolean Models and Methods 2010: 197-220 - [p11]Robert H. Sloan, Balázs Szörényi, György Turán, Yves Crama, Peter L. Hammer:
Learning Boolean Functions with Queries. Boolean Models and Methods 2010: 221-256 - [p10]Claude Carlet, Yves Crama, Peter L. Hammer:
Boolean Functions for Cryptography and Error-Correcting Codes. Boolean Models and Methods 2010: 257-397 - [p9]Claude Carlet, Yves Crama, Peter L. Hammer:
Vectorial Boolean Functions for Cryptography. Boolean Models and Methods 2010: 398-470 - [p8]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Yves Crama, Peter L. Hammer:
Binary Decision Diagrams. Boolean Models and Methods 2010: 473-505 - [p7]Matthias Krause, Ingo Wegener, Yves Crama, Peter L. Hammer:
Circuit Complexity. Boolean Models and Methods 2010: 506-530 - [p6]Jehoshua Bruck, Yves Crama, Peter L. Hammer:
Fourier Transforms and Threshold Circuit Complexity. Boolean Models and Methods 2010: 531-553 - [p5]Martin Anthony, Yves Crama, Peter L. Hammer:
Neural Networks and Boolean Functions. Boolean Models and Methods 2010: 554-576 - [p4]Martin Anthony, Yves Crama, Peter L. Hammer:
Decision Lists and Related Classes of Boolean Functions. Boolean Models and Methods 2010: 577-596 - [p3]Jie-Hong Roland Jiang, Tiziano Villa, Yves Crama, Peter L. Hammer:
Hardware Equivalence and Property Verification. Boolean Models and Methods 2010: 599-674 - [p2]Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli, Yves Crama, Peter L. Hammer:
Synthesis of Multilevel Boolean Networks. Boolean Models and Methods 2010: 675-722 - [p1]Charles J. Colbourn, Yves Crama, Peter L. Hammer:
Boolean Aspects of Network Reliability. Boolean Models and Methods 2010: 723-759 - [e1]Yves Crama, Peter L. Hammer:
Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Cambridge University Press 2010, ISBN 9780511780448 [contents] - 2004
- [j28]Gabriela Alexe, Sorin Alexe, Yves Crama, Stephan Foldes, Peter L. Hammer, Bruno Simeone:
Consensus algorithms for the generation of all maximal bicliques. Discret. Appl. Math. 145(1): 11-21 (2004) - 2000
- [j22]Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Boolean Normal Forms, Shellability, and Reliability Computations. SIAM J. Discret. Math. 13(2): 212-226 (2000) - 1997
- [j20]Yves Crama, Oya Ekin, Peter L. Hammer:
Variable and Term Removal From Boolean Formulae. Discret. Appl. Math. 75(3): 217-230 (1997) - 1994
- [j13]Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks:
A Complexity Index for Satisfiability Problems. SIAM J. Comput. 23(1): 45-49 (1994) - 1992
- [j10]Endre Boros, Yves Crama, Peter L. Hammer:
Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization. SIAM J. Discret. Math. 5(2): 163-177 (1992) - [c1]Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks:
A Complexity Index for Satisfiability Problems. IPCO 1992: 220-226 - 1990
- [j8]Endre Boros, Yves Crama, Peter L. Hammer:
Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae. Ann. Math. Artif. Intell. 1: 21-32 (1990) - [j6]Claude Benzaken, Yves Crama, Pierre Duchet, Peter L. Hammer, Frédéric Maffray:
More characterizations of triangulated graphs. J. Graph Theory 14(4): 413-422 (1990) - [j5]Yves Crama, Peter L. Hammer, Toshihide Ibaraki:
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices. Math. Oper. Res. 15(2): 258-267 (1990) - 1989
- [j4]Yves Crama, Peter Ladislaw Hammer:
Bimatroidal independence systems. ZOR Methods Model. Oper. Res. 33(3): 149-165 (1989) - 1986
- [j1]Yves Crama, Peter L. Hammer, Toshihide Ibaraki:
Strong unimodularity for matrices and hypergraphs. Discret. Appl. Math. 15(2-3): 221-239 (1986)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
