Sciweavers

173 search results - page 19 / 35
» A Proof of the Two-path Conjecture
Sort
View
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
14 years 3 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali
DLT
2010
13 years 10 months ago
Inclusion Problems for Patterns with a Bounded Number of Variables
We study the inclusion problems for pattern languages that are generated by patterns with a bounded number of variables. This continues the work by Freydenberger and Reidenbach (In...
Joachim Bremer, Dominik D. Freydenberger
CSR
2011
Springer
13 years 4 days ago
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov
ICALP
2007
Springer
14 years 2 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
DM
2010
89views more  DM 2010»
13 years 8 months ago
Large induced subgraphs with equated maximum degree
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
Yair Caro, Raphael Yuster