A Graph Enhanced Symbolic Discovery Framework For Efficient Logic Optimization
No confident code implementation found for this paper. 4 possible matches can be shown below.
No confident code implementation found for this paper. 4 possible matches can be shown below.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Transferable Structural Sparse Adversarial Attack Via Exact Group Sparsity Training
Learning Geometric Reasoning Networks For Robot Task And Motion Planning
Fast Attention Over Long Sequences With Dynamic Sparse Flash Attention
A Simple Yet Powerful Deep Active Learning With Snapshots Ensembles
Distributed Active Client Selection With Noisy Clients Using Model Association Scores
Rethinking Graph Neural Networks From A Geometric Perspective Of Node Features
@article{bai2026graph,
title = {A Graph Enhanced Symbolic Discovery Framework For Efficient Logic Optimization},
author = {Yinqi Bai and Jie Wang and Lei Chen and Zhihai Wang and Yufei Kuang and Mingxuan Yuan and Jianye Hao and Feng Wu},
year = {2026},
url = {https://api.semanticscholar.org/CorpusID:0f0e1a92362989fbe8a25d691b17f0e64d6eb67f},
journal = {ICLR 2025 2025}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/0f0e1a92362989fbe8a25d691b17f0e64d6eb67f)