- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-7586
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Counting Boolean functions with faster points ; day:11 ; month:3 ; year:2020 ; pages:1-17
Designs, codes and cryptography ; (11.3.2020), 1-17
- Urheber
-
Sălăgean, Ana
Özbudak, Ferruh
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10623-020-00738-7
- URN
-
urn:nbn:de:101:1-2020060319273056722153
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:04 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Sălăgean, Ana
- Özbudak, Ferruh
- SpringerLink (Online service)
Ähnliche Objekte (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 : 31.10.1999 - 05.11.1999
Complexity of Boolean functions : 10.03. - 14.03.97
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 : 31.10.1999 - 05.11.1999
Complexity of Boolean functions : 10.03. - 14.03.97
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 : 31.10.1999 - 05.11.1999