The following pages link to Igor L. Markov (Q427731):
Displayed 31 items.
- Design, analysis and test of logic circuits under uncertainty (Q427733) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- Item:Q427731 (redirect page) (← links)
- Functional design errors in digital circuits. Diagnosis correction and repair (Q951243) (← links)
- Dynamic symmetry-breaking for Boolean satisfiability (Q976993) (← links)
- Resolution cannot polynomially simulate compressed-BFS (Q1776193) (← links)
- Improving gate-level simulation of quantum circuits (Q2573093) (← links)
- (Q2743958) (← links)
- Synthesis and optimization of reversible circuits—a survey (Q2875110) (← links)
- Conflict Anticipation in the Search for Graph Automorphisms (Q2891455) (← links)
- Simulation of Quantum Circuits via Stabilizer Frames (Q2982161) (← links)
- (Q3166025) (← links)
- (Q3171609) (← links)
- (Q3522464) (← links)
- (Q3522508) (← links)
- (Q3522514) (← links)
- (Q3534618) (← links)
- VLSI Physical Design: From Graph Partitioning to Timing Closure (Q3577051) (← links)
- (Q3624016) (← links)
- Simulating Quantum Computation by Contracting Tensor Networks (Q3631899) (← links)
- (Q3633950) (← links)
- Quantum Circuit Simulation (Q3648493) (← links)
- Efficient optimization by modifying the objective function: applications to timing-driven VLSI layout (Q4540170) (← links)
- Solution and Optimization of Systems of Pseudo-Boolean Constraints (Q4564226) (← links)
- (Q4707784) (← links)
- Symmetry and Satisfiability: An Update (Q4930583) (← links)
- Symmetry breaking for pseudo-Boolean formulas (Q5269268) (← links)
- Design and implementation of move-based heuristics for VLSI hypergraph partitioning (Q5463400) (← links)
- Recent Advances in Constraints (Q5703914) (← links)
- VLSI Physical Design: From Graph Partitioning to Timing Closure (Q6060787) (← links)
- Graph Symmetry Detection and Canonical Labeling: Differences and Synergies (Q6235331) (← links)