We describe three orthogonal complexity measures parallel time amount of hardware and degree of non uniformity which together parametrize most complexity classes We show that the descriptive com plexity framework neatly captures these measures using three parameters quanti er depth number of variables and type of numeric predicates re spectively A fairly simple picture arises in which the basic...

Electronic copies of technical reports are available: Via FTP: Host ftp.informatik.uni-trier.de, directory /pub/reports Via gopher: Host gopher.informatik.uni-trier.de, port 70, type 1, pathes 1/TechReports/Abstracts and 1/TechReports/FullText Via WWW: URL http://www.informatik.uni-trier.de/Reports/List Via email: Send a mail to [email protected], subject ’MAIL ME CLEAR’, body...

The paper is concerned with testing uniformity versus a monotone density. This problem arises in two important contexts, after transformations, testing whether a sample is a simple random sample or a biased sample, and testing whether the intensity function of a nonhomogeneous Poisson process is constant against monotone alternatives. A penalized likelihood ratio test (P-test) and a Dip likelih...

ACKNOWLEDGMENT This work was supported by the U.S. Department of Energy Office of Inertial Fusion under agreement No. DE-FC03-85DP40200 and by the Laser Fusion Feasibility Project at the Laboratory for Laser Energetics, which has the following sponsors: Empire State Electric Energy Research Corporation, New York State Energy Research and Development Authority, Ontario Hydro, and the University ...

G raph theory is the appropriate language for discussing binary relations on objects. Results in graph theory have numerous applications in biology, chemistry, computer science, and physics. In cases of multiple relations, instead of binary relations more general structures known as hypergraphs are the right tools. However, it turns out that because of their extremely complex structure, hypergr...