arXiv (OAI Expanded)
open access
Designing Compact ILPs via Fast Witness Verification
The standard formalization of preprocessing in parameterized complexity is given by kernelization. In this work, we depart from this paradigm and study a different type of preprocessing for problems without polynomial kernels, still aiming at producing instances that are easily solvable in practice.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Designing Compact ILPs via Fast Witness Verification#819250
- Fast Witness Extraction using a Decision Oracle#420797
- Verifying Sampling Algorithms via Distributional Invariants / Daniel Zilken, Kevin Batz, Joost-Pieter Katoen, Tobias Winkler#780428
- Verifying Numerical Methods with Isabelle/HOL#1052048
- AgentDV: Closed-Loop Agentic AI for Hardware Design Verification#1104467
Record · ID 809258
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive