Name
Abstract | ||
|---|---|---|
The performance of many mathematical and computational tasks highly depends on the implementation of polynomial arithmetic. Motivated by improving the efficiency of the computation of boolean Gröbner bases, we present a cache-aware representation of sparse boolean polynomials. We also present extremely high-performance implementations of the polynomial operations required in classical Gröbner basis algorithms. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICEEE.2015.7357937 | 2015 12th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE) |
Keywords | Field | DocType |
Data structure,Cache-aware,Polynomial,Boolean,Gr öbner basis | Maximum satisfiability problem,Boolean circuit,Polynomial arithmetic,Computer science,Theoretical computer science,Standard Boolean model,Boolean algebra,And-inverter graph,Boolean expression,Two-element Boolean algebra | Conference |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rodrigo Alexander Castro Campos | 1 | 0 | 1.35 |
| Féliu D. Sagols Troncoso | 2 | 0 | 0.34 |
| Francisco Javier Zaragoza Martínez | 3 | 0 | 0.34 |