UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

PPSZ for General k-SAT and CSP—Making Hertli’s Analysis Simpler and 3-SAT Faster

Computational complexity, 2024-12, Vol.33 (2), Article 13

2024

Volltextzugriff (PDF)

PPSZ is better than you think

TheoretiCS, 2024-03, Vol.3

Scheder, Dominik

2024

Volltextzugriff (PDF)

PPSZ is better than you think

2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, p.205-216

Scheder, Dominik

2022

Volltextzugriff (PDF)

PPSZ for k ≥ 5: More Is Better

ACM transactions on computation theory, 2019-09, Vol.11 (4), p.1-22

Scheder, Dominik

2019

Volltextzugriff (PDF)

Recent studies of agent incentives in internet resource allocation and pricing

Annals of operations research, 2022-07, Vol.314 (1), p.49-76

2022

Volltextzugriff (PDF)

Recent studies of agent incentives in internet resource allocation and pricing

4OR, 2018-09, Vol.16 (3), p.231-260

2018

Volltextzugriff (PDF)

Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas

Algorithms and Computation, 2013, p.251-261

2013

Volltextzugriff (PDF)

Unsatisfiable CNF Formulas contain Many Conflicts

Algorithms and Computation, 2013, p.273-283

2013

Volltextzugriff (PDF)

A full derandomization of schöning's k-SAT algorithm

Proceedings of the forty-third annual ACM symposium on Theory of computing, 2011, p.245-252

2011

Volltextzugriff (PDF)

Guided Search and a Faster Deterministic Algorithm for 3-SAT

LATIN 2008: Theoretical Informatics, 2008, p.60-71

2008

Volltextzugriff (PDF)

A new bound for 3-satisfiable MaxSat and its algorithmic application

Information and computation, 2013-10, Vol.231, p.117-124

2013

Volltextzugriff (PDF)

Overlays and Limited Memory Communication

2014 IEEE 29th Conference on Computational Complexity (CCC), 2014, p.298-308

2014

Volltextzugriff (PDF)

Super strong ETH is true for PPSZ with small resolution width

Proceedings of the 35th Computational Complexity Conference, 2020, p.1-12

2020

Volltextzugriff (PDF)

The Lovász Local Lemma and Satisfiability

Efficient Algorithms, 2009, p.30-54

2009

Volltextzugriff (PDF)

Partial Satisfaction of k-Satisfiable Formulas

Electronic notes in discrete mathematics, 2007-08, Vol.29, p.497-501

2007

Volltextzugriff (PDF)

The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors

Principles and Practice of Constraint Programming, 2016, Vol.9892, p.421-437

2016

Volltextzugriff (PDF)

Derandomization of k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\boldsymbol{k}$$\end{document}-SAT Algorithm

Encyclopedia of Algorithms, 2016, p.524-528

2016

Volltextzugriff (PDF)

Exponential Lower Bounds for k-SAT Algorithms

Encyclopedia of Algorithms, 2016, p.705-708

2016

Volltextzugriff (PDF)

How Many Conflicts Does It Need to Be Unsatisfiable?

Theory and Applications of Satisfiability Testing - SAT 2008, 2008, Vol.4996, p.246-256

2008

Volltextzugriff (PDF)

On the Average Sensitivity and Density of k-CNF Formulas

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013, p.683-698

2013

Volltextzugriff (PDF)

Satisfiability with Exponential Families

Theory and Applications of Satisfiability Testing - SAT 2007, 2007, Vol.4501, p.148-158

2007

Volltextzugriff (PDF)

Cryptogenography

Proceedings of the 5th conference on Innovations in theoretical computer science, 2014, p.13-22

2014

Volltextzugriff (PDF)

Exponential lower bounds for the PPSZ k-sat algorithm

Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, 2013, p.1253-1263

2013

Volltextzugriff (PDF)

Approaches to approximating the minimum weight k-edge connected spanning subgraph of a mixed graph

Scheder, Dominik Alban

2005

Volltextzugriff (PDF)

Intraoperative computed tomography with integrated navigation system in spinal stabilizations

Spine (Philadelphia, Pa. 1976), 2009-12, Vol.34 (26), p.2919-2926

2009

Volltextzugriff (PDF)

1 – 25 von 27

Menü

Weitere Dienste

Einstellungen

PPSZ for General k-SAT and CSP—Making Hertli’s Analysis Simpler and 3-SAT Faster

PPSZ is better than you think

PPSZ is better than you think

PPSZ for k ≥ 5: More Is Better

Recent studies of agent incentives in internet resource allocation and pricing

Recent studies of agent incentives in internet resource allocation and pricing

Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas

Unsatisfiable CNF Formulas contain Many Conflicts

A full derandomization of schöning's k-SAT algorithm

Guided Search and a Faster Deterministic Algorithm for 3-SAT

A new bound for 3-satisfiable MaxSat and its algorithmic application

Overlays and Limited Memory Communication

Super strong ETH is true for PPSZ with small resolution width

The Lovász Local Lemma and Satisfiability

Partial Satisfaction of k-Satisfiable Formulas

The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors

Derandomization of k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\boldsymbol{k}$$\end{document}-SAT Algorithm

Exponential Lower Bounds for k-SAT Algorithms

How Many Conflicts Does It Need to Be Unsatisfiable?

On the Average Sensitivity and Density of k-CNF Formulas

Satisfiability with Exponential Families

Cryptogenography

Exponential lower bounds for the PPSZ k-sat algorithm

Approaches to approximating the minimum weight k-edge connected spanning subgraph of a mixed graph

Intraoperative computed tomography with integrated navigation system in spinal stabilizations

Suchergebnisse filtern