Satisfiability in Boolean Logic (SAT problem) is polynomial? (Q5071401): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q385069 / rank
Normal rank
 
Property / author
 
Property / author: Vladimir Vladimirovich Rybakov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205154944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating hard satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissible rules for pretable modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A criterion for admissibility of rules in the modal system S4 and intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical equations and admissible rules of inference with parameters in modal provability logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissibility of logical inference rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090774 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:14, 28 July 2024

scientific article; zbMATH DE number 7510991
Language Label Description Also known as
English
Satisfiability in Boolean Logic (SAT problem) is polynomial?
scientific article; zbMATH DE number 7510991

    Statements

    Identifiers