default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID52nd ISMVL 2022: Dallas, TX, USA
- 52nd IEEE International Symposium on Multiple-Valued Logic, ISMVL 2022, Dallas, TX, USA, May 18-20, 2022. IEEE 2022, ISBN 978-1-6654-2395-3
- Aviraj Sinha, Mitchell A. Thornton:
Quantum Multiple Valued Kernel Circuits. 1-8 - Philipp Niemann, Rolf Drechsler
:
Polynomial-Time Formal Verification of Adder Circuits for Multiple-Valued Logic. 9-14 - Jongbeom Kim, Yeji Kim, Hyundong Lee, Jihyeong Yun, Hyeseung Jang, Huijeen Jin, Juhee Park, Bongjun Kim, Taigon Song:
A Convenient Implementation of the Ternary Logic: Using Anti-Ambipolar Transistors and PMOS Based on Printed Carbon Nanotubes. 15-20 - Hyundong Lee, Hyeseung Jang, Jihyeong Yun, Huijeen Jin, Jongbeom Kim, Yeji Kim, Taigon Song:
Ternary Competitive to Binary: A Novel Implementation of Ternary Logic Using Depletion-mode and Conventional MOSFETs. 21-26 - Abdirahman Alasow, Marek A. Perkowski:
Quantum Algorithm for Maximum Satisfiability. 27-34 - Kamalika Datta, Abhoy Kole, Indranil Sengupta, Rolf Drechsler:
Nearest Neighbor Mapping of Quantum Circuits to Two-Dimensional Hexagonal Qubit Architecture. 35-42 - Andrew Litteken, Jonathan M. Baker, Frederic T. Chong:
Communication Trade Offs in Intermediate Qudit Circuits. 43-49 - Milena Stankovic, Radomir S. Stankovic, Claudio Moraga, Jaakko T. Astola:
Construction of Ternary Bent Functions From Ternary Linear Functions. 50-55 - Claudio Moraga, Radomir S. Stankovic, Milena Stankovic:
On new Properties of the Maiorana-McFarland Ternary Bent Functions. 56-61 - Hajime Machida:
Centralizing Monoids, Majority Operations and the Słupecki Clone. 62-67 - Mike Behrisch:
Weak bases for Boolean relational clones revisited. 68-73 - Claudio Moraga, Radomir S. Stankovic, Milena Stankovic:
Bent-based Realization of a Class of Ternary Plateaued Functions. 74-79 - Michael Pinsker:
Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep. 80-87 - Ivan Chajda, Helmut Länger, Jan Paseka:
Constructions of Kleene lattices. 88-93 - Ambroise Baril, Miguel Couceiro, Victor Lagerkvist:
An Algebraic Approach Towards the Fine-Grained Complexity of Graph Coloring Problems. 94-99 - Norihiro Kamide:
Falsification-aware Semantics for Description Logics. 100-105 - Thomas Macaulay Ferguson:
Non-Deterministic Many-Valued Modal Logic. 106-112 - Andrea Karalic, Jovanka Pantovic, Hristina Suknjaja:
Characteristic Vectors of Reversible Boolean Functions with Threshold Components. 113-118 - Norihiro Kamide:
Falsification-aware Twist Structures in Description Logic. 119-124 - Jon T. Butler, Tsutomu Sasao:
On the Sensitivity of Boolean and Multiple-Valued Symmetric Functions. 125-130 - Damián Enrique Szmuc, Hitoshi Omori:
Liberating classical negation from falsity conditions. 131-136 - Hitoshi Omori, Jonas Rafael Becker Arenhart:
Haack meets Herzberger and Priest. 137-144 - Tomasz Mazurkiewicz:
Approximate memory-based logic synthesis of index generation functions using linear decomposition. 145-150 - Tsutomu Sasao:
LUT Cascade Realization of Threshold Functions and Its Application to Implementation of Ternary Weight Neural Networks. 151-157 - Kennichi Nakamura, Hiroki Nakahara:
Optimizations of Ternary Generative Adversarial Networks. 158-163 - Shinobu Nagayama, Tsutomu Sasao, Jon T. Butler:
On Decision Diagrams for Maximally Asymmetric Functions. 164-169 - Yosuke Iijima, Kazuharu Nakajima, Yasushi Yuminaka:
Two-Dimensional Symbol Mapping for Evaluating Multi-Valued Data Transmission Quality. 170-175 - Tsutomu Sasao:
A Method To Generate Rules From Examples. 176-181 - Ryota Kayanoma, Hiroki Nakahara:
Fast Interface with Ensemble Ternary Neural Network. 182-187 - Micah Thornton:
Phase & Power in Genomic Harmonic Analysis. 188-193
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-19 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
