✦ LIBER ✦

Uniform normal form for general time-bounded complexity classes

✍ Scribed by Bernard R. Hodgson; Clement F. Kent

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 407 KB
Volume: 32
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90034-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A comparison of the complexity of the lo

A comparison of the complexity of the longest and shortest disjunctive normal forms and a lower bound for the number of prime disjunctive normal forms for almost all Boolean functions

✍ A. D. Korshunov 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 690 KB

On lower bounds for the complexity of di

On lower bounds for the complexity of disjunctive normal forms of Boolean functions with a small number of zeros

✍ A.Yu. Kogan 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 510 KB

Computation of the normal forms for gene

Computation of the normal forms for general M-DOF systems using multiple time scales. Part I: autonomous systems

✍ Pei Yu; Songhui Zhu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 744 KB

This paper is concerned with the symbolic computation of the normal forms of general multiple-degreeof-freedom oscillating systems. A perturbation technique based on the method of multiple time scales, without the application of center manifold theory, is generalized to develop efficient algorithms

Computation of the normal forms for gene

Computation of the normal forms for general M-DOF systems using multiple time scales. Part II: non-autonomous systems

✍ Songhui Zhu; Pei Yu 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 834 KB

A perturbation technique has been developed in Part I to consider the computation of the normal forms for general multiple-degree-of-freedom autonomous systems. In this paper, the perturbation approach is extended to study general non-autonomous systems and is focused on systems with external forcin