On the public citation graph

Computational complexity of controllability/observability problems for combinational circuits

0 signed · 49 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0010-4485(86)90300-3openalex-snapshot
Logic Testing and Design for testability
inferredcites →https://doi.org/10.1109/t-c.1975.224205openalex-snapshot
Polynomially Complete Fault Detection Problems
inferredcites →https://doi.org/10.1109/tc.1982.1676041openalex-snapshot
The Complexity of Fault Detection Problems for Combinational Logic Circuits
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.7551/mitpress/4317.001.0001openalex-snapshot
Logic Testing and Design for Testability

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-387-33403-3_7openalex-snapshot
On-Chip Property Verification Using Assertion Processors
inferred← citeshttps://doi.org/10.1007/978-1-4615-3958-2_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4615-3958-2_11openalex-snapshot
Polynomial-time Testability
inferred← citeshttps://doi.org/10.1007/978-1-4615-3958-2_2openalex-snapshot
Logic Circuits and Testing
inferred← citeshttps://doi.org/10.1007/978-3-031-39031-9_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/bf00135229openalex-snapshot
The minimum test set problem for circuits with nonreconvergent fanout
inferred← citeshttps://doi.org/10.1007/bf00135230openalex-snapshot
Test generation, design-for-testability and built-in self-test for arithmetic units based on graph labeling
inferred← citeshttps://doi.org/10.1007/bf00971963openalex-snapshot
Energy minimization and design for testability
inferred← citeshttps://doi.org/10.1007/bf00971973openalex-snapshot
On the generation of test patterns for multiple faults
inferred← citeshttps://doi.org/10.1007/bf02939500openalex-snapshot
GLOBAL: A design for random testability algorithm
inferred← citeshttps://doi.org/10.1016/j.biosystems.2019.02.013openalex-snapshot
Fault detection and therapeutic intervention in gene regulatory networks using SAT solvers
inferred← citeshttps://doi.org/10.1109/12.238481openalex-snapshot
Generalized Hopfield neural network for concurrent testing
inferred← citeshttps://doi.org/10.1109/12.238487openalex-snapshot
Test-pattern generation based on Reed-Muller coefficients
inferred← citeshttps://doi.org/10.1109/12.262124openalex-snapshot
Polynomial time testability of circuits generated by input decomposition
inferred← citeshttps://doi.org/10.1109/4.75014openalex-snapshot
Circuit partitioning for logic synthesis
inferred← citeshttps://doi.org/10.1109/43.664230openalex-snapshot
Nonscan design-for-testability techniques using RT-level design information
inferred← citeshttps://doi.org/10.1109/asic.1995.580705openalex-snapshot
On the complexity of bridging fault simulation techniques for CMOS integrated circuits
inferred← citeshttps://doi.org/10.1109/ats.2002.1181691openalex-snapshot
Non-scan design for testability based on fault oriented conflict analysis
inferred← citeshttps://doi.org/10.1109/ats.2004.12openalex-snapshot
A New Way of Detecting Reconvergent Fanout Branch Pairs in Logic Circuits
inferred← citeshttps://doi.org/10.1109/ats.2004.16openalex-snapshot
A Systematic Way of Functional Testing for VLSI Chips
inferred← citeshttps://doi.org/10.1109/autest.1995.522670openalex-snapshot
Bridging fault simulation using Iddq, logic, and delay testing
inferred← citeshttps://doi.org/10.1109/ets61313.2024.10567242openalex-snapshot
Polynomial Formal Verification of Approximate Adders with Constant Cutwidth
inferred← citeshttps://doi.org/10.1109/ftcs.1990.89335openalex-snapshot
Polynomial time solvable fault detection problems
inferred← citeshttps://doi.org/10.1109/icvd.1992.658020openalex-snapshot
On Computing Tests for Bridging and Leakage Faults: Complexity Results and Universal Test Sets
inferred← citeshttps://doi.org/10.1109/ismvl60454.2024.00037openalex-snapshot
Polynomial Formal Verification of Multi-Valued Logic Circuits within Constant Cutwidth Architectures
inferred← citeshttps://doi.org/10.1109/itc-asia53059.2021.9808799openalex-snapshot
Developing Formal Models for Measuring Fault Effects Using Functional EDA Tools
inferred← citeshttps://doi.org/10.1109/lats57337.2022.9936904openalex-snapshot
Fast and Exact is Doable: Polynomial Algorithms in Test and Verification
inferred← citeshttps://doi.org/10.1109/mwscas.2003.1562582openalex-snapshot
Automatic test pattern generation from high level specifications
inferred← citeshttps://doi.org/10.1109/tcad.2008.927757openalex-snapshot
A Nonscan Design-for-Testability Method for Register-Transfer-Level Circuits to Guarantee Linear-Depth Time Expansion Models
inferred← citeshttps://doi.org/10.1109/tcad.2022.3147100openalex-snapshot
SPAR: A New Test-Point Insertion Using Shared Points for Area Overhead Reduction
inferred← citeshttps://doi.org/10.1109/tcsi.2025.3531008openalex-snapshot
Polynomial Formal Verification of Multi-Valued Approximate Circuits Within Constant Cutwidth
inferred← citeshttps://doi.org/10.1109/tifs.2012.2189105openalex-snapshot
On the Complexity of Generating Gate Level Information Flow Tracking Logic
inferred← citeshttps://doi.org/10.1109/vtest.1991.208154openalex-snapshot
On polynomial-time testable classes of combinational circuits
inferred← citeshttps://doi.org/10.1109/vtest.1992.232754openalex-snapshot
The roles of controllability and observability in design for test
inferred← citeshttps://doi.org/10.1109/vtest.1997.600276openalex-snapshot
Exact probabilistic analysis of error detection for parity checkers
inferred← citeshttps://doi.org/10.1145/1967677.1967693openalex-snapshot
Software debugging and testing using the abstract diagnosis theory
inferred← citeshttps://doi.org/10.1145/2016603.1967693openalex-snapshot
Software debugging and testing using the abstract diagnosis theory
inferred← citeshttps://doi.org/10.1145/309847.309857openalex-snapshot
Why is ATPG easy?
inferred← citeshttps://doi.org/10.1145/3625223.3649274openalex-snapshot
Polynomial Formal Verification exploiting Constant Cutwidth
inferred← citeshttps://doi.org/10.1145/3799714openalex-snapshot
Linear Formal Verification of Sequential Circuits using Weighted-AIGs
inferred← citeshttps://doi.org/10.1155/1993/42309openalex-snapshot
Coverage of Node Shorts Using Internal Access andEquivalence Classes
inferred← citeshttps://doi.org/10.1155/2001/45324openalex-snapshot
An Efficient Test Pattern Generation Scheme for an On Chip BIST
inferred← citeshttps://doi.org/10.23919/acc.2017.7963696openalex-snapshot
A linear approach to fault analysis in Boolean networks
inferred← citeshttps://doi.org/10.48550/arxiv.1809.03135openalex-snapshot
A Linear Approach to Fault Analysis and Intervention in Boolean Systems
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.