Search results
From MaRDI portal
- https://portal.mardi4nfdi.de/entity/Q2857384 2013-11-01 Paper Note on strong refutation algorithms for random k-SAT formulas 2013-07-19 Paper Weak quasi-randomness...10 bytes (17 words) - 02:35, 10 December 2023
- mardi4nfdi.de/entity/Q2939531 2015-01-22 Paper Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem 2014-07-01 Paper Short proofs for the...10 bytes (16 words) - 08:58, 6 October 2023
- An expected polynomial time algorithm for coloring 2-colorable 3-graphs 2013-10-10 Paper Note on strong refutation algorithms for random k-SAT formulas 2013-07-19...10 bytes (18 words) - 02:39, 7 October 2023
- An expected polynomial time algorithm for coloring 2-colorable 3-graphs 2013-10-10 Paper Note on strong refutation algorithms for random k-SAT formulas 2013-07-19...10 bytes (17 words) - 02:18, 10 December 2023
- A new algorithm for the minimum spanning tree verification problem 2015-04-20 Paper Improved algorithms for optimal length resolution refutation in difference...10 bytes (17 words) - 00:03, 10 December 2023
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas 2022-02-14 Paper Analyzing unit read-once refutations in difference...10 bytes (18 words) - 17:51, 11 December 2023
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas 2022-02-14 Paper Analyzing unit read-once refutations in difference...10 bytes (19 words) - 00:03, 10 December 2023
- 2006-06-01 Paper Algorithms and Computation 2005-12-22 Paper Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 2005-08-25...10 bytes (16 words) - 03:31, 9 December 2023
- Optimization. Algorithms and Techniques 2005-08-25 Paper Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT...10 bytes (16 words) - 08:19, 7 October 2023
- bisimulation checking algorithms for the \(\pi\)-calculus 2000-06-13 Paper Universal abstract consistency class and universal refutation 1999-09-13 Paper Verifying...10 bytes (16 words) - 09:11, 24 September 2023
- transitions and message passing algorithms 2015-04-27 Paper State evolution for general approximate message passing algorithms, with applications to spatial...10 bytes (16 words) - 02:15, 9 December 2023
- Publication Date of Publication Type Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random 2023-12-08 Paper https://portal...10 bytes (16 words) - 03:06, 25 September 2023
- bisimulation checking algorithms for the \(\pi\)-calculus 2000-06-13 Paper Universal abstract consistency class and universal refutation 1999-09-13 Paper https://portal...10 bytes (17 words) - 06:09, 12 December 2023
- 1994-08-21 Paper Nonequivalence of input paramodulation refutation and unit paramodulation refutation 1993-05-16 Paper...10 bytes (16 words) - 10:05, 7 October 2023
- https://portal.mardi4nfdi.de/entity/Q6147330 2024-01-15 Paper Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random 2023-12-08 Paper...10 bytes (18 words) - 16:10, 13 December 2023
- heuristic algorithms for the image of an injective function 2013-04-09 Paper The complexity of inverting explicit Goldreich's function by DPLL algorithms 2013-04-09...10 bytes (18 words) - 21:19, 11 December 2023
- graphs towards Betti numbers and persistence diagrams 2022-03-02 Paper Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes 2021-01-25...10 bytes (16 words) - 18:28, 11 December 2023
- ESTIMATION VIA SUM-OF-SQUARES PROOFS 2020-09-22 Paper The threshold for SDP-refutation of random regular NAE-3SAT 2019-10-15 Paper On the Integrality Gap of...10 bytes (16 words) - 00:23, 25 September 2023
- On the SUP-INF Method for Proving Presburger Formulas 1977-01-01 Paper Refutation graphs 1976-01-01 Paper Gossips and telephones 1972-01-01 Paper...10 bytes (18 words) - 12:32, 13 December 2023
- https://portal.mardi4nfdi.de/entity/Q6147277 2024-01-15 Paper Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random 2023-12-08 Paper...10 bytes (17 words) - 21:31, 8 December 2023
