1445 search results - page 9 / 289 » Uniformly Hard Languages |
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
ACL
1997
13 years 9 months ago
1997
We propose a unified framework in which to treat semantic underspecification and parallelism phenomena in discourse. The framework employs a constraint language that can express e...
JSYML
2010
13 years 2 months ago
2010
We prove that given any first order formula in the language L = {+,
FOCS
2000
IEEE
14 years 2 days ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
IEICET
2006
13 years 7 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...