Author:
Kojevnikov Arist,Kulikov Alexander S.,Yaroslavtsev Grigory
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Chin, A.: On the depth complexity of the counting functions. Information Processing Letters 35, 325–328 (1990)
2. Eén, N.: Practical SAT — a tutorial on applied satisfiability solving. Slides of invited talk at FMCAD (2007)
3. Lecture Notes in Computer Science;G.G. Estrada,2003
4. Fischer, M.J., Meyer, A.R., Paterson, M.S.: Ω(n logn) lower bounds on length of Boolean formulas. SIAM Journal on Computing 11, 416–427 (1982)
5. Fogel, D.B.: Evolutionary computation: The fossil record. IEEE Press, New York (1998)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Novel Fence Generation Methods for Accelerating Reconfigurable Exact Synthesis;2023 IEEE 66th International Midwest Symposium on Circuits and Systems (MWSCAS);2023-08-06
2. Formula Normalizations in Verification;Computer Aided Verification;2023
3. Topology-Based Exact Synthesis for Majority Inverter Graph;2022 IEEE International Symposium on Circuits and Systems (ISCAS);2022-05-28
4. Three-Input Gates for Logic Synthesis;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2021-10
5. Algebraic and Boolean Optimization Methods for AQFP Superconducting Circuits;Proceedings of the 26th Asia and South Pacific Design Automation Conference;2021-01-18