| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Much Ado About Two
| Title: | Much Ado About Two |
| Author: | Sascha Böhme |
| Submission date: | 2007-11-06 |
| Abstract: | This article is an Isabelle formalisation of a paper with the same title. In a similar way as Knuth's 0-1-principle for sorting algorithms, that paper develops a 0-1-2-principle for parallel prefix computations. |
| BibTeX: |
@article{MuchAdoAboutTwo-AFP,
author = {Sascha Böhme},
title = {Much Ado About Two},
journal = {Archive of Formal Proofs},
month = nov,
year = 2007,
note = {\url{http://isa-afp.org/entries/MuchAdoAboutTwo.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |