From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “Boolean function complexity” 6

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

The Descriptive Complexity of Graph Neural Networks
2024 TheoretiCS article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe

3

citations
Boolean Operation for CAD Models Using a Hybrid Representation
2025 ACM Transactions on Graphics article Computer Science Computational Geometry and Mesh Generation Open access

Yingyu Yang, Xiaohong Jia, Bolun Wang, Jieyin Yang, Shiqing Xin, Dong‐Ming Yan

4

citations
Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries
2025 Proceedings of the ACM on Management of Data article Computer Science Advanced Database Systems and Queries Open access

Christoph Standke, Benny Kimelfeld

0

citations
A Novel Approach to Designing Surrogate-assisted Genetic Algorithms by Combining Efficient Learning of Walsh Coefficients and Dependencies
2021 ACM Transactions on Evolutionary Learning and Optimization article Computer Science Metaheuristic Optimization Algorithms Research Open access

Arkadiy Dushatskiy, Tanja Alderliesten, Peter A. N. Bosman

14

citations
Computing high-degree polynomial gradients in memory
2024 Nature Communications article Engineering Advanced Memory and Neural Computing Open access cited by 1 patent

Tinish Bhattacharya, George Higgins Hutchinson, Giacomo Pedretti, Xia Sheng, Jim Ignowski, Thomas Van Vaerenbergh, +3 more

22

citations
LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States
2023 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Lieuwe Vinkhuijzen, Tim Coopmans, David Elkouss, Vedran Dunjko, Alfons Laarman

26

citations

6 results