Short Resolution refutations of Ref(φ) yield satisfying assignments for φ in polynomial time via a PV1-formalizable construction, and the Proof Analysis Problem is NP-complete for Extended Frege.
Simplified and improved resolution lower bounds
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Presents a successive convexification framework that enforces continuous-time STL specifications in trajectory optimization via GMSR robustness and prox-convex solving.
A win-win reduction from worst-case decoding and distinguishing problems yields average-case LPN hardness at noise rate n to the minus alpha for any constant alpha less than 1.
The paper defines FO Cost-Value Decision for token-sliding discovery and proves FPT and W[1]-hardness results for Partial Vertex Cover Discovery across various graph classes.
For functions with optimal decision tree of size s, max depth D_opt and avg depth Δ_opt, greedy builds an ε-approximating tree of size at most exp(Δ_opt D_opt log(e/ε)) under product distributions.
A fuzzy temporal logic for motion planning that elevates paths to first-class citizens with quantitative satisfaction degrees to support intuitive human specs and learning from data.
A review surveying coupling mechanisms in superconducting qubit-mechanical resonator hybrids and their extension to optomechanical architectures for quantum sensing applications.
citing papers explorer
-
The Proof Analysis Problem
Short Resolution refutations of Ref(φ) yield satisfying assignments for φ in polynomial time via a PV1-formalizable construction, and the Proof Analysis Problem is NP-complete for Extended Frege.
-
Successive Convexification for Trajectory Optimization with Continuous-time Satisfaction of Signal Temporal Logic Specifications
Presents a successive convexification framework that enforces continuous-time STL specifications in trajectory optimization via GMSR robustness and prox-convex solving.
-
Towards Worst-case Hardness for Low-Noise LPN
A win-win reduction from worst-case decoding and distinguishing problems yields average-case LPN hardness at noise rate n to the minus alpha for any constant alpha less than 1.
-
FO Value Discovery and Partial Vertex Cover Discovery
The paper defines FO Cost-Value Decision for token-sliding discovery and proves FPT and W[1]-hardness results for Partial Vertex Cover Discovery across various graph classes.
-
Decision Tree Learning on Product Spaces
For functions with optimal decision tree of size s, max depth D_opt and avg depth Δ_opt, greedy builds an ε-approximating tree of size at most exp(Δ_opt D_opt log(e/ε)) under product distributions.
-
Logic of Fuzzy Paths
A fuzzy temporal logic for motion planning that elevates paths to first-class citizens with quantitative satisfaction degrees to support intuitive human specs and learning from data.
-
Fundamentals and Applications of Hybrid Electro- and Opto-mechanical system coupled to Superconducting Qubit: A Short Review
A review surveying coupling mechanisms in superconducting qubit-mechanical resonator hybrids and their extension to optomechanical architectures for quantum sensing applications.