Sciweavers

2095 search results - page 22 / 419
» Improved pebbling bounds
Sort
View
COCOON
2009
Springer
16 years 22 days ago
An Improved Time-Space Lower Bound for Tautologies
Scott Diehl, Dieter van Melkebeek, Ryan Williams
COLT
2005
Springer
15 years 11 months ago
Improved Second-Order Bounds for Prediction with Expert Advice
Nicolò Cesa-Bianchi, Yishay Mansour, Gilles...
WAOA
2004
Springer
76views Algorithms» more  WAOA 2004»
15 years 11 months ago
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria
Rajiv Gandhi, Magnús M. Halldórsson,...
DATE
2003
IEEE
100views Hardware» more  DATE 2003»
15 years 11 months ago
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals
: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining
Gianpiero Cabodi, Sergio Nocco, Stefano Quer