Sciweavers

ECCC
2011
217views ECommerce» more  ECCC 2011»
13 years 2 months ago
ReachFewL = ReachUL
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
Brady Garvin, Derrick Stolee, Raghunath Tewari, N....
JSC
2010
94views more  JSC 2010»
13 years 9 months ago
P versus NP and geometry
In this primarily expository article, I describe geometric approaches to variants of P v. NP, present several results that illustrate the role of group actions in complexity theory...
J. M. Landsberg
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 11 months ago
Interpolation in Valiant's theory
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
Pascal Koiran, Sylvain Perifel
IANDC
2008
74views more  IANDC 2008»
13 years 11 months ago
Baire categories on small complexity classes and meager-comeager laws
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
Philippe Moser
APAL
2006
64views more  APAL 2006»
13 years 11 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký
AMAST
2006
Springer
14 years 2 months ago
Some Programming Languages for Logspace and Ptime
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
Guillaume Bonfante
MFCS
1989
Springer
14 years 2 months ago
Space Bounded Computations: Review And New Separation Results
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
Juris Hartmanis, Desh Ranjan
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
14 years 2 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson
STACS
1993
Springer
14 years 3 months ago
A First-Order Isomorphism Theorem
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
Eric Allender, José L. Balcázar, Nei...
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 3 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman