A DNF without Regular Shortest Consensus Path

descriptionPublicationkeyboard_double_arrow_right Article 01 Oct 1987 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 16, pages 836-840 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Wenqui Huang; Xiangdong Yu;

doi: 10.1137/0216054

A DNF without Regular Shortest Consensus Path

- Summary
- Subjects
- Metrics

Abstract

Exhibiting a disjunctive normal form without regular shortest consensus path, the authors give a negative answer to a question posed by \textit{G. S. Tsejtin} [Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 8, 234-259 (1968; Zbl 0197.001)].

Related Organizations

University of Science and Technologies
Uzbekistan

Keywords

Mechanization of proofs and logical operations, consensus, resolution, disjunctive normal form, Boolean functions, Theorem proving (deduction, resolution, etc.)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average