On the time required by the Davis-Putnam tautology recognition algorithm (1971)
- Autor:
- Autor USP: SIMON, IMRE - IME
- Unidade: IME
- Assunto: MATEMÁTICA
- Language: Inglês
- Imprenta:
- Publisher: University of Waterloo
- Publisher place: Waterloo
- Date published: 1971
-
ABNT
SIMON, Imre. On the time required by the Davis-Putnam tautology recognition algorithm. . Waterloo: University of Waterloo. . Acesso em: 27 dez. 2025. , 1971 -
APA
Simon, I. (1971). On the time required by the Davis-Putnam tautology recognition algorithm. Waterloo: University of Waterloo. -
NLM
Simon I. On the time required by the Davis-Putnam tautology recognition algorithm. 1971 ;[citado 2025 dez. 27 ] -
Vancouver
Simon I. On the time required by the Davis-Putnam tautology recognition algorithm. 1971 ;[citado 2025 dez. 27 ] - A β-function that is not a sum of rank functions of matroids
- Síntese moderna de filtros no computador, 2a parte
- Conditions de finitude pour des semi-groupes
- Infinite words and a theorem of Hindman
- The product of rational languages
- Factorization forests of finite height
- Compression and entropy
- Characterizations of locally testable events
- Limited subsets of a free monoid
- Conditions de finitude pour des semigroups
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
