Complexity of propositional proofs under a promise (Q2946606): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Merged Item from Q5428817
 
(5 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Complexity of Propositional Proofs Under a Promise
description / endescription / en
scientific article
scientific article; zbMATH DE number 5215575
Property / title
 
Complexity of Propositional Proofs Under a Promise (English)
Property / title: Complexity of Propositional Proofs Under a Promise (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1171.03334 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-540-73420-8_27 / rank
 
Normal rank
Property / published in
 
Property / published in: Automata, Languages and Programming / rank
 
Normal rank
Property / publication date
 
28 November 2007
Timestamp+2007-11-28T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 28 November 2007 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5215575 / rank
 
Normal rank
Property / zbMATH Keywords
 
proof complexity
Property / zbMATH Keywords: proof complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153912760 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1887629677 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0707.4255 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:10, 6 May 2024

scientific article; zbMATH DE number 5215575
  • Complexity of Propositional Proofs Under a Promise
Language Label Description Also known as
English
Complexity of propositional proofs under a promise
scientific article; zbMATH DE number 5215575
  • Complexity of Propositional Proofs Under a Promise

Statements

Complexity of propositional proofs under a promise (English)
0 references
Complexity of Propositional Proofs Under a Promise (English)
0 references
0 references
0 references
17 September 2015
0 references
28 November 2007
0 references
promise problems
0 references
propositional proof complexity
0 references
random 3CNF
0 references
resolution
0 references
proof complexity
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references