CASCADING RANDOM WALKS
From MaRDI portal
Recommendations
Cites work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A randomized linear-time algorithm to find minimum spanning trees
- A simpler minimum spanning tree verification algorithm
- A theory of the learnable
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 1514781 (Why is no real title available?)
- New methods for 3-SAT decision and worst-case analysis
- On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
- On the Complexity of Timetable and Multicommodity Flow Problems
- Solving satisfiability in less than \(2^ n\) steps
Cited in
(9)- Random walks for selected Boolean implication and equivalence problems
- A branching random walk among disasters
- Absorbing Random Walks and the NAE2SAT Problem
- On memoryless provers and insincere verifiers
- scientific article; zbMATH DE number 1261202 (Why is no real title available?)
- scientific article; zbMATH DE number 1737509 (Why is no real title available?)
- scientific article; zbMATH DE number 2152205 (Why is no real title available?)
- Absorbing random walks and the NAE2SAT problem
- On 2-QBF truth testing in parallel
This page was built for publication: CASCADING RANDOM WALKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5462126)