<--- Back to Details
First PageDocument Content
Mathematics / Logic / Automated theorem proving / Logic programming / Logical truth / Propositional calculus / Substitution / Abstraction / Polynomials / Fundamental theorem of algebra / Permutation polynomial
Date: 2016-06-01 05:46:52
Mathematics
Logic
Automated theorem proving
Logic programming
Logical truth
Propositional calculus
Substitution
Abstraction
Polynomials
Fundamental theorem of algebra
Permutation polynomial

1 Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms Siddharth Jain, Farzad Farnoud (Hassanzadeh), Member, IEEE, Moshe Schwartz, Senior Member, IEEE, Jehoshua Bruck, Fellow, IEEE

Add to Reading List

Source URL: www.paradise.caltech.edu

Download Document from Source Website

File Size: 236,53 KB

Share Document on Facebook

Similar Documents

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT  INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING  1. I NTRODUCTION

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION

DocID: 1vah4 - View Document

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

DocID: 1sXwT - View Document

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

DocID: 1sOSK - View Document

Microsoft Word - BlankPage

Microsoft Word - BlankPage

DocID: 1rugC - View Document

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

DocID: 1rrok - View Document