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...

Solving #SAT and Bayesian Inference with Backtracking Search

The Journal of artificial intelligence research, 2009-01, Vol.34, p.391-442

2009

Volltextzugriff (PDF)

Inapproximability of Treewidth and Related Problems

The Journal of artificial intelligence research, 2014-04, Vol.49, p.569-600

2014

Volltextzugriff (PDF)

Semialgebraic Proofs and Efficient Algorithm Design

Foundations and trends in theoretical computer science, 2019-01, Vol.14 (1-2), p.1-221

2019

Volltextzugriff (PDF)

Toward a model for backtracking and dynamic programming

20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005, p.308-322

2005

Volltextzugriff (PDF)

The complexity of resolution refinements

18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings, 2003, p.138-147

2003

Volltextzugriff (PDF)

Reducing the complexity of reductions

Computational complexity, 2001-01, Vol.10 (2), p.117-138

2001

Volltextzugriff (PDF)

A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness

20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005, p.52-66

2005

Volltextzugriff (PDF)

Memoization and DPLL: formula caching proof systems

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings, 2003, p.248-259

2003

Volltextzugriff (PDF)

Improved depth lower bounds for small distance connectivity

Computational complexity, 1998-12, Vol.7 (4), p.325-345

1998

Volltextzugriff (PDF)

Special Issue In Memory of Misha Alekhnovich. Foreword

Computational complexity, 2011-12, Vol.20 (4), p.579-590

2011

Volltextzugriff (PDF)

Algorithms and complexity results for #SAT and Bayesian inference

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings, 2003, p.340-351

2003

Volltextzugriff (PDF)

The efficiency of resolution and Davis-Putnam procedures

SIAM journal on computing, 2002-01, Vol.31 (4), p.1048-1075

2002

Volltextzugriff (PDF)

On interpolation and automatization for frege systems

SIAM journal on computing, 2000-01, Vol.29 (6), p.1939-1967

2000

Volltextzugriff (PDF)

Stochastic Boolean Satisfiability

Journal of automated reasoning, 2001-10, Vol.27 (3), p.251-296

2001

Volltextzugriff (PDF)

Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity

Automata, Languages and Programming, 2005, p.1176-1188

2005

Volltextzugriff (PDF)

Upper and lower bounds for tree-like cutting planes proofs

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 1994, p.220-228

1994

Volltextzugriff (PDF)

Non-automatizability of bounded-depth Frege proofs

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), 1999, p.15-23

1999

Volltextzugriff (PDF)