Pages that link to "Item:Q5215904"
From MaRDI portal
The following pages link to Semialgebraic Proofs and Efficient Algorithm Design (Q5215904):
Displaying 13 items.
- Logical semirings and their usage for construction of quick algorithms (Q1280316) (← links)
- (Q4251070) (← links)
- (Q4736859) (← links)
- Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- The Spectrum of the Grigoriev–Laurent Pseudomoments (Q6187076) (← links)
- Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)
- Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations (Q6574949) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- First-order reasoning and efficient semi-algebraic proofs (Q6614038) (← links)
- Book review of: T. Theobald, Real algebraic geometry and optimization (Q6646761) (← links)
- On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems (Q6649455) (← links)