CC
2008
Springer
13 years 11 months ago
2008
Springer
CC
2008
Springer
13 years 11 months ago
2008
Springer
CC
2008
Springer
13 years 11 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
CC
2008
Springer
13 years 11 months ago
2008
Springer
We introduce an algebraic proof system that manipulates multilinear arithmetic formulas. We show that this proof system is fairly strong, even when restricted to multilinear arith...
CC
2008
Springer
13 years 11 months ago
2008
Springer
We use derandomization to show that sequences of positive pspace-dimension
CC
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
CC
2010
Springer
13 years 11 months ago
2010
Springer
We solve an open problem in communication complexity posed by Kushilevitz and Nisan (1997). Let R (f) and D
IWPT
2001
14 years 1 months ago
2001
This paper discusses the process of parsing adult utterances directed to a child, in an effort to produce a syntactically annotated corpus of the verbal input to a human language ...
IWPT
2001
14 years 1 months ago
2001
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
IWPT
2001
14 years 1 months ago
2001
While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which ...