- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-7586
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Counting Boolean functions with faster points ; day:11 ; month:3 ; year:2020 ; pages:1-17
Designs, codes and cryptography ; (11.3.2020), 1-17
- Creator
-
Sălăgean, Ana
Özbudak, Ferruh
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10623-020-00738-7
- URN
-
urn:nbn:de:101:1-2020060319273056722153
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:04 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Sălăgean, Ana
- Özbudak, Ferruh
- SpringerLink (Online service)
Other Objects (12)
Towards Faster Conflict-Driven Pseudo-Boolean Solving
Counting and characterising functions with “fast points” for differential attacks
On canalizing Boolean functions
Counting points, counting fields, and heights on stacks
Faster algorithms for counting subgraphs in sparse graphs
Boolean functions and computation models
Cardinal functions on Boolean algebras
The complexity of Boolean functions
Five valued quasi Boolean functions
Counting points on smooth plane quartics
Complexity of Boolean functions : 10.03. - 14.03.97
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
Towards Faster Conflict-Driven Pseudo-Boolean Solving
Counting and characterising functions with “fast points” for differential attacks
On canalizing Boolean functions
Counting points, counting fields, and heights on stacks
Faster algorithms for counting subgraphs in sparse graphs
Boolean functions and computation models
Cardinal functions on Boolean algebras
The complexity of Boolean functions
Five valued quasi Boolean functions
Counting points on smooth plane quartics
Complexity of Boolean functions : 10.03. - 14.03.97
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
Towards Faster Conflict-Driven Pseudo-Boolean Solving
Counting and characterising functions with “fast points” for differential attacks
On canalizing Boolean functions
Counting points, counting fields, and heights on stacks
Faster algorithms for counting subgraphs in sparse graphs
Boolean functions and computation models
Cardinal functions on Boolean algebras
The complexity of Boolean functions
Five valued quasi Boolean functions
Counting points on smooth plane quartics
Complexity of Boolean functions : 10.03. - 14.03.97