First Page | Document Content | |
---|---|---|
Date: 2017-09-02 14:08:49Mathematics Theoretical computer science Constraint programming Functions and mappings Electronic design automation Logic in computer science NP-complete problems Satisfiability modulo theories Rounding Limit of a function Function | Real Behavior of Floating Point Numbers * Bruno Marre1 , Fran¸cois Bobot1 , and Zakaria Chihani1 CEA LIST, Software Security Lab, Gif-sur-Yvette, FranceAdd to Reading ListSource URL: smt-workshop.cs.uiowa.eduDownload Document from Source WebsiteFile Size: 337,25 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |