Sciweavers

Share
COCO
2006
Springer
65views Algorithms» more  COCO 2006»
10 years 3 months ago
An Isomorphism between Subexponential and Parameterized Complexity Theory
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
Yijia Chen, Martin Grohe
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
10 years 3 months ago
A Duality between Clause Width and Clause Density for SAT
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
Chris Calabro, Russell Impagliazzo, Ramamohan Patu...
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
10 years 3 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
10 years 3 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
COCO
2006
Springer
75views Algorithms» more  COCO 2006»
10 years 3 months ago
Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries
We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded ...
Albert Atserias
COCO
2006
Springer
113views Algorithms» more  COCO 2006»
10 years 3 months ago
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
Eric Allender, Peter Bürgisser, Johan Kjeldga...
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
10 years 3 months ago
Grid Graph Reachability Problems
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...
books