K Subramani - ACM Transactions on Computational Logic (TOCL), 2004 - dl.acm.org
Optimal Length Tree-Like Resolution Refutations for 2SAT Formulas Page 1 Optimal Length Tree-Like Resolution Refutations for 2SAT Formulas K. SUBRAMANI LDCSEE, West Virginia …
Z Xu, W Li - Grid and Cooperative Computing: Second International …, 2004 - Springer
This paper presents a computer systems approach used in the Vega Grid project at Institute of Computing Technology, Chinese Academy of Sciences. The main feature is to view a grid …
We present complexity hierarchies on circuits under two DLOGTIME-uniformity conditions. It is shown that there is a language which can be recognized by a family of U_\tinyE-uniform …
M Schmitt - Journal of Machine Learning Research, 2004 - jmlr.org
The computational complexity of learning from binary examples is investigated for linear threshold neurons. We introduce combinatorial measures that create classes of infinitely …
MC Golumbic - Annals of Discrete Mathematics, 2004 - Elsevier
Publisher Summary With the advent of the high-speed electronic computer, new branches of applied mathematics have sprouted forth. One area that has enjoyed a most rapid growth in …