arXiv (All)
open access
A Better Analysis For PPSZ For 3-SAT
The PPSZ algorithm of Paturi, Pudlák, Saks, and Zane solves 3-SAT by processing the variables in a uniformly random order, setting a variable whenever a bounded number of clauses implies its value, and guessing it otherwise. Its running time is determined by how many variables are forced in this pro
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
- A Polynomial time Algorithm for 3SAT#158580
- Topics in Theoretical Computer Science: An Algorithmist's Toolkit#66957
- AlgoRAG: Retrieval-Augmented Generation for Theoretical Computer Science Education -- A Comprehensive Evaluation Framework for Algorithm Analysis and Complexity Theory#1084516
- The Simulation Argument Revisited through the Reconstruction of its Missing Elements#689114
- A simplified proof of polynomial improvements for 3SUM and APSP#1326913
Record · ID 1468275
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