Sciweavers

30 search results - page 3 / 6
» New Directions in Instantiation-Based Theorem Proving
Sort
View
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 8 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
13 years 8 months ago
The Multiplicative Quantum Adversary
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
Robert Spalek
COMBINATORICS
1998
86views more  COMBINATORICS 1998»
13 years 6 months ago
Lattice Tilings by Cubes: Whole, Notched and Extended
We discuss some problems of lattice tiling via Harmonic Analysis methods. We consider lattice tilings of Rd by the unit cube in relation to the Minkowski Conjecture (now a theorem...
Mihail N. Kolountzakis
CRYPTO
2007
Springer
116views Cryptology» more  CRYPTO 2007»
14 years 13 days ago
Random Oracles and Auxiliary Input
We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain informa...
Dominique Unruh
LPAR
2010
Springer
13 years 4 months ago
Counting and Enumeration Problems with Bounded Treewidth
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...