✦ LIBER ✦

A maximum-complexity theorem for nondynamical parity tests

✍ Scribed by P. L. Csonka; M. J. Moravcsik

Book ID: 105622269
Publisher: Springer-Verlag
Year: 1967
Weight: 394 KB
Volume: 50
Category: Article
ISSN: 0369-3546
DOI: 10.1007/bf02823527

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A theorem on intuitive tests of parity c

A theorem on intuitive tests of parity conservation via spin polarization processes

✍ Robert M. Saenger 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 242 KB

A Test for Global Maximum

✍ Li Gan and Jiming Jiang 📂 Article 📅 1999 🏛 American Statistical Association 🌐 English ⚖ 980 KB

A parity bit signature for exhaustive te

A parity bit signature for exhaustive testing

✍ Akers, S.B. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 593 KB

A reduction theorem for complexity of fi

A reduction theorem for complexity of finite semigroups

✍ John Rhodes; Bret Tilson 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 591 KB

A maximum modulus theorem for linear fra

A maximum modulus theorem for linear fractional transformations

✍ Andy Packard; J. Whitney Balsamo 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 172 KB

A Dichotomy Theorem for Maximum Generali

A Dichotomy Theorem for Maximum Generalized Satisfiability Problems

✍ N. Creignou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 930 KB

We study the complexity of an infinite class of optimization satisfiability problems. Each problem is represented through a finite set, \(S\), of logical relations (generalizing the notion of clauses of bounded length). We prove the existence of a dichotomic classification for optimization satisfiab