Complexity of Propositional Proofs under a Promise

Research output: Contribution to conference › Paper › peer-review

36 Downloads (Pure)

Original language	English
Number of pages	30
Publication status	Published - 2007
Event	Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP) track A - Wraslaw, Poland Duration: 10 Jul 2007 → …

Conference	Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP) track A
Country/Territory	Poland
City	Wraslaw
Period	10/07/07 → …

Keywords

@conference{5193a406311142f9b90d7469d5fbf7dd,

title = "Complexity of Propositional Proofs under a Promise",

keywords = "complexity theory",

author = "Nachum Dershowitz and Iddo Tzameret",

year = "2007",

language = "English",

note = "Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP) track A ; Conference date: 10-07-2007",

}