Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking

Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking

datePublished

• 2004

description

• kuvitettu

identifier

• propertyID: FI-FENNI value: 769089
• propertyID: FI-MELINDA value: 003924803
• propertyID: skl value: fx769089

isbn

• 951227020X

isPartOf

• Fennica
• Tampereen yliopisto. E, Yhteiskuntatieteiden tutkimuslaitos

name

• Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking

numberOfPages

• v, 45 sivua

P60048

• <http://rdaregistry.info/termList/RDACarrierType/1049>

P60050

• <http://rdaregistry.info/termList/RDAMediaType/1007>

publication

• location: Espoo organizer: Teknillinen korkeakoulu

publisher

• Teknillinen korkeakoulu