Stop the war!
Остановите войну!
for scientists:
default search action
"On Some Bandwidth Restricted Versions of the Satisfiability Problem of ..."
Vikraman Arvind, Somenath Biswas (1989)
- Vikraman Arvind, Somenath Biswas:
On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. Theor. Comput. Sci. 68(2): 123-134 (1989)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.