Constructing hazard-free Boolean circuits proven NP-hard
thomasahle · x · 2026-11-10
Thomas Ahle highlights the result that constructing hazard-free Boolean circuits is NP-hard, with a thread explaining it. A hazard-free circuit stays stable when an input transitions between 0 and 1 — important for hardware correctness — but this property can force exponentially larger circuits, and now the construction itself is shown to be NP-hard.
Related event: Building Hazard-Free Boolean Circuits Proved NP-Hard(2 posts)→
More from Research
- Your ML Model Does Not Understand Dates: Cheap Timestamp Transforms That Boost Accuracy — dima806_dima · 2026-11-10
- WorkflowArena: First Benchmark for Multi-Agent Workflow Orchestration With 145 Real-World Tasks — _akhaliq · 2026-11-10
- Kenneth Stanley's team releases open-endedness research agenda: blog + 4 preprints — kenneth0stanley · 2026-11-10
- Cellpose-SAM hits 0.163 error rate, beating human annotator disagreement on cell segmentation — RichardsonDx · 2026-11-10
- NVIDIA-led study: unblocking VLM gradients in VLA training lifts manipulation progress from 10.3% to 32.9% — stepjamUK · 2026-11-10
- Hugging Face explains Decision Models: probability outputs without text generation — ariG23498 · 2026-11-10