Sciweavers

876 search results - page 58 / 176
» New Results for the Martin Polynomial
Sort
View
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 8 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
NETWORKING
2000
13 years 10 months ago
Spare Capacity Planning for Survivable Mesh Networks
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
Adel Al-Rumaih, David Tipper, Yu Liu, Bryan A. Nor...
JSAT
2006
92views more  JSAT 2006»
13 years 8 months ago
A Translation of Pseudo Boolean Constraints to SAT
This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the p...
Olivier Bailleux, Yacine Boufkhad, Olivier Roussel
CORR
2012
Springer
185views Education» more  CORR 2012»
12 years 4 months ago
Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be iden...
Johannes Textor, Maciej Liskiewicz
COCO
2010
Springer
148views Algorithms» more  COCO 2010»
14 years 19 days ago
Derandomizing from Random Strings
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
Harry Buhrman, Lance Fortnow, Michal Koucký...