Home ›
Entities
› academia
› Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions
Research article (SpringerPlus, 2016) · cited 25× · AI/ML
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions
Summary
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions is a scholarly article[1].
Key Facts
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions. Retrieved May 24, 2026, from https://4ort.xyz/entity/algorithm-for-finding-partitionings-of-hard-variants-of-boolean-satisfiability-problem-with-application-to-inversion-of-
MLA“Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/algorithm-for-finding-partitionings-of-hard-variants-of-boolean-satisfiability-problem-with-application-to-inversion-of-.
BibTeX@misc{4ortxyz_algorithm-for-finding-partitionings-of-hard-variants-of-boolean-satisfiability-problem-with-application-to-inversion-of-_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions}}, year = {2026}, url = {https://4ort.xyz/entity/algorithm-for-finding-partitionings-of-hard-variants-of-boolean-satisfiability-problem-with-application-to-inversion-of-}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions — https://4ort.xyz/entity/algorithm-for-finding-partitionings-of-hard-variants-of-boolean-satisfiability-problem-with-application-to-inversion-of- (retrieved 2026-05-24)
