On the public citation graph
Placement and Routing for Tile-based Field-coupled Nanocomputing Circuits Is NP -complete (Research Note)
0 signed · 68 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45949-9openalex-snapshot
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
inferredcites →https://doi.org/10.1007/978-3-662-43722-3openalex-snapshot
Field-Coupled Nanocomputing: Paradigms, Progress, and Perspectives
inferredcites →https://doi.org/10.1007/978-3-662-43722-3_3openalex-snapshot
Silicon Atomic Quantum Dots Enable Beyond-CMOS Electronics
inferredcites →https://doi.org/10.1007/s10825-014-0590-zopenalex-snapshot
A novel quantum-dot cellular automata CLB of FPGA
inferredcites →https://doi.org/10.1016/0012-365x(92)90687-bopenalex-snapshot
On the complexity of finding iso- and other morphisms for partial k-trees
inferredcites →https://doi.org/10.1016/0022-0000(80)90057-4openalex-snapshot
The subgraph homeomorphism problem
inferredcites →https://doi.org/10.1016/0196-6774(87)90030-7openalex-snapshot
O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1016/j.jda.2008.10.003openalex-snapshot
An exact algorithm for subgraph homeomorphism
inferredcites →https://doi.org/10.1016/j.mejo.2015.03.023openalex-snapshot
Design and evaluation of an ultra-area-efficient fault-tolerant QCA full adder
inferredcites →https://doi.org/10.1021/acsnano.7b04238openalex-snapshot
Atomic White-Out: Enabling Atomic Circuitry through Mechanically Induced Bonding of Single Hydrogen Atoms to a Silicon Surface
inferredcites →https://doi.org/10.1039/c1nr10988jopenalex-snapshot
Toward quantum-dot cellular automata units: thiolated-carbazole linked bisferrocenes
inferredcites →https://doi.org/10.1049/iet-cds.2016.0252openalex-snapshot
Optimal synthesis of QCA logic circuit eliminating wire‐crossings
inferredcites →https://doi.org/10.1063/1.1421217openalex-snapshot
Power gain and dissipation in quantum-dot cellular automata
inferredcites →https://doi.org/10.1109/5.573740openalex-snapshot
A device architecture for computing with quantum dots
inferredcites →https://doi.org/10.1109/dsd.2018.00110openalex-snapshot
Evaluating the Impact of Interconnections in Quantum-Dot Cellular Automata
inferredcites →https://doi.org/10.1109/iscas.2016.7538997openalex-snapshot
A Methodology for Standard Cell Design for QCA
inferredcites →https://doi.org/10.1109/nano.2018.8626294openalex-snapshot
Synchronization of Clocked Field-Coupled Circuits
inferredcites →https://doi.org/10.1109/sbcci.2016.7724048openalex-snapshot
A Placement and routing algorithm for Quantum-dot Cellular Automata
inferredcites →https://doi.org/10.1109/tcad.2007.907020openalex-snapshot
Two-Dimensional Schemes for Clocking/Timing of QCA Circuits
inferredcites →https://doi.org/10.1109/tcad.2015.2471996openalex-snapshot
USE: A Universal, Scalable, and Efficient Clocking Scheme for QCA
inferredcites →https://doi.org/10.1109/tcad.2018.2789782openalex-snapshot
An Energy-Aware Model for the Logic Synthesis of Quantum-Dot Cellular Automata
inferredcites →https://doi.org/10.1109/tmag.2012.2196030openalex-snapshot
Nanomagnetic Logic: Error-Free, Directed Signal Transmission by an Inverter Chain
inferredcites →https://doi.org/10.1109/tmag.2013.2249576openalex-snapshot
Experimental Realization of a Nanomagnet Full Adder Using Slanted-Edge Magnets
inferredcites →https://doi.org/10.1109/tnano.2008.2005408openalex-snapshot
Estimation of Upper Bound of Power Dissipation in QCA Circuits
inferredcites →https://doi.org/10.1109/tnano.2012.2220565openalex-snapshot
New Methodology for the Design of Efficient Binary Addition Circuits in QCA
inferredcites →https://doi.org/10.1109/tnano.2016.2619377openalex-snapshot
Modeling, Design, and Analysis of MagnetoElastic NML Circuits
inferredcites →https://doi.org/10.1109/tvlsi.2018.2821107openalex-snapshot
Parallel and Serial Computation in Nanomagnet Logic: An Overview
inferredcites →https://doi.org/10.1116/1.1394729openalex-snapshot
Clocking of molecular quantum-dot cellular automata
inferredcites →https://doi.org/10.1145/1116696.1116697openalex-snapshot
Tile-based QCA design using majority-like logic primitives
inferredcites →https://doi.org/10.1145/2660540.2660997openalex-snapshot
A Quantum-Dot Cellular Automata Processor Design
inferredcites →https://doi.org/10.1145/3287624.3287705openalex-snapshot
Scalable design for field-coupled nanocomputing circuits
inferredcites →https://doi.org/10.1515/9780773591134-052openalex-snapshot
Improved orthogonal drawings of 3-graphs
inferredcites →https://doi.org/10.23919/date.2018.8342060openalex-snapshot
An exact method for design exploration of quantum-dot cellular automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10470-020-01648-3openalex-snapshot
Evaluating nanomagnetic logic circuit layouts using different clock schemes
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2022.107999openalex-snapshot
Design of efficient binary-coded decimal adder in QCA technology with a regular clocking scheme
inferred← citeshttps://doi.org/10.1016/j.micpro.2020.103109openalex-snapshot
On the impact of the synchronization constraint and interconnections in quantum-dot cellular automata
inferred← citeshttps://doi.org/10.1080/00207217.2026.2630811openalex-snapshot
A scalable and adaptive cell-level mapping algorithm for QCA placement and routing
inferred← citeshttps://doi.org/10.1088/2399-1984/ada8ffopenalex-snapshot
Unfolding potential and challenges in molecular field-coupled nanocomputing
inferred← citeshttps://doi.org/10.1109/dac18072.2020.9218641openalex-snapshot
Verification for Field-coupled Nanocomputing Circuits
inferred← citeshttps://doi.org/10.1109/dsd51259.2020.00071openalex-snapshot
ToPoliNano and fiction: Design Tools for Field-coupled Nanocomputing
inferred← citeshttps://doi.org/10.1109/iscas51556.2021.9401107openalex-snapshot
NMLib: A Nanomagnetic Logic Standard Cell Library
inferred← citeshttps://doi.org/10.1109/isqed60706.2024.10528711openalex-snapshot
Thinking Outside the Clock: Physical Design for Field-coupled Nanocomputing with Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/isvlsi49217.2020.00022openalex-snapshot
Bail on Balancing: An Alternative Approach to the Physical Design of Field-Coupled Nanocomputing Circuits
inferred← citeshttps://doi.org/10.1109/isvlsi49217.2020.00040openalex-snapshot
Design Automation for Field-Coupled Nanotechnologies
inferred← citeshttps://doi.org/10.1109/isvlsi59464.2023.10238604openalex-snapshot
Versatile Signal Distribution Networks for Scalable Placement and Routing of Field-coupled Nanocomputing Technologies
inferred← citeshttps://doi.org/10.1109/lascas64004.2025.10966234openalex-snapshot
Physical Design for Field-coupled Nanocomputing with Discretionary Cost Objectives
inferred← citeshttps://doi.org/10.1109/lascas64004.2025.10966240openalex-snapshot
Network Collapsing Placement and Routing for Field-Coupled Nanocomputing
inferred← citeshttps://doi.org/10.1109/nano58406.2023.10231278openalex-snapshot
Scalable Physical Design for Silicon Dangling Bond Logic: How a 45° Turn Prevents the Reinvention of the Wheel
inferred← citeshttps://doi.org/10.1109/nano61778.2024.10628747openalex-snapshot
The Munich N anotech Toolkit (MNT)
inferred← citeshttps://doi.org/10.1109/nano61778.2024.10628808openalex-snapshot
A* is Born: Efficient and Scalable Physical Design for Field-coupled Nanocomputing
inferred← citeshttps://doi.org/10.1109/nano61778.2024.10628962openalex-snapshot
On-the-fly Defect-Aware Design of Circuits based on Silicon Dangling Bond Logic
inferred← citeshttps://doi.org/10.1109/nano63165.2025.11113822openalex-snapshot
A Fully Planar Approach to Field-Coupled Nanocomputing: Scalable Placement and Routing Without Wire Crossings
inferred← citeshttps://doi.org/10.1109/nano63165.2025.11113823openalex-snapshot
MNT Designer: A Comprehensive Design Tool for Field-Coupled Nanocomputing
inferred← citeshttps://doi.org/10.1109/tcad.2025.3549354openalex-snapshot
Efficient and Scalable Post-Layout Optimization for Field-Coupled Nanotechnologies
inferred← citeshttps://doi.org/10.1109/tcsi.2022.3197450openalex-snapshot
Field-Coupled Nanocomputing Placement and Routing With Genetic and A* Algorithms
inferred← citeshttps://doi.org/10.1109/tcsi.2025.3614709openalex-snapshot
Graph-Oriented Layout Design for Field-Coupled Nanocomputing via Parallel Multi-Objective Search Space Exploration
inferred← citeshttps://doi.org/10.1145/3365394openalex-snapshot
Near Zero-Energy Computation Using Quantum-Dot Cellular Automata
inferred← citeshttps://doi.org/10.1145/3394885.3431607openalex-snapshot
One-pass Synthesis for Field-coupled Nanocomputing Technologies
inferred← citeshttps://doi.org/10.1145/3565478.3572529openalex-snapshot
Exploiting the Third Dimension: Stackable Quantum-dot Cellular Automata
inferred← citeshttps://doi.org/10.1145/3611315.3633247openalex-snapshot
Post-Layout Optimization for Field-coupled Nanotechnologies
inferred← citeshttps://doi.org/10.1145/3670417openalex-snapshot
Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.