An and-inverter graph (AIG) is a directed, acyclic graph that represents a structural implementation of the logical functionality of a circuit orâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Xuejiao Ma, Yinshui Xia
- 2017 IEEE 12th International Conference on ASICâ€¦
- 2017

Power consumption minimization is an important design goal for digital circuits. To cope with the limitation of traditionalâ€¦Â (More)

Is this relevant?

2016

2016

- Luca Gaetano AmarÃ¹, Pierre-Emmanuel Gaillardon, Giovanni De Micheli
- IEEE Transactions on Computer-Aided Design ofâ€¦
- 2016

In this paper, we propose a paradigm shift in representing and optimizing logic by using only majority (MAJ) and inversion (INVâ€¦Â (More)

Is this relevant?

2016

2016

- Winston Haaswijk, Mathias Soeken, Luca Gaetano AmarÃ¹, Pierre-Emmanuel Gaillardon, Giovanni De Micheli
- 2016

A Majority-Inverter Graph (MIG) is a directed acyclic graph in which every vertex represents a three-input majority operation andâ€¦Â (More)

Is this relevant?

2016

2016

- Mathias Soeken, Anupam Chattopadhyay
- 2016 53nd ACM/EDAC/IEEE Design Automationâ€¦
- 2016

Latest quantum technologies promise realization of extremely large circuits, whereas, reversible logic synthesis, the keyâ€¦Â (More)

Is this relevant?

2013

2013

Linac x-ray and direct gamma irradiation sources were used in this study to irradiate simple polycrystalline alaninein-glass (AiGâ€¦Â (More)

Is this relevant?

2011

2011

- Jason Helge Anderson, Qiang Wang
- 16th Asia and South Pacific Design Automationâ€¦
- 2011

We consider architecture and synthesis techniques for FPGA logic elements (function generators) and show that the LUT-based logicâ€¦Â (More)

Is this relevant?

2009

2009

- Susmit Jha, Rhishikesh Limaye, Sanjit A. Seshia
- CAV
- 2009

We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifierfree finite-precision bit-vectorâ€¦Â (More)

Is this relevant?

2006

2006

And-Inverter Graphs (AIGs) are an efficient and scalable representation for boolean formulas and circuits. We present a maximalâ€¦Â (More)

Is this relevant?

2006

2006

- Florian Pigorsch, Christoph Scholl, Stefan Disch
- MBMV
- 2006

In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to theâ€¦Â (More)

Is this relevant?

1989

1989

- Felipe Cucker, Joaquim GabarrÃ³
- ITA
- 1989

In this note we shaii prove that non primitive recursive functions have transcendental generating series. This resuit translatesâ€¦Â (More)

Is this relevant?