Standard

Optimal acceptors and optimal proof systems. / Hirsch, Edward A.

Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings. 2010. стр. 28-39 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 6108 LNCS).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Hirsch, EA 2010, Optimal acceptors and optimal proof systems. в Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 6108 LNCS, стр. 28-39, 7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010, Prague, Чехия, 7/06/10. https://doi.org/10.1007/978-3-642-13562-0_4

APA

Hirsch, E. A. (2010). Optimal acceptors and optimal proof systems. в Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings (стр. 28-39). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 6108 LNCS). https://doi.org/10.1007/978-3-642-13562-0_4

Vancouver

Hirsch EA. Optimal acceptors and optimal proof systems. в Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings. 2010. стр. 28-39. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-13562-0_4

Author

Hirsch, Edward A. / Optimal acceptors and optimal proof systems. Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings. 2010. стр. 28-39 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{31932bed8c9c46cda0352fa051af9c88,
title = "Optimal acceptors and optimal proof systems",
abstract = "Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-tautologies (with no time restriction). Unless we resolve the co-NP vs NP question, we are unable to say whether there is a proof system that has a polynomial-size proof for every tautology. In such a situation, it is typical for complexity theorists to search for {"}universal{"} objects; here, it could be the {"}fastest{"} acceptor (called optimal acceptor) and a proof system that has the {"}shortest{"} proof (called optimal proof system) for every tautology. Neither of these objects is known to the date. In this survey we review the connections between these questions and generalizations of acceptors and proof systems that lead or may lead to universal objects.",
author = "Hirsch, {Edward A.}",
year = "2010",
month = jul,
day = "15",
doi = "10.1007/978-3-642-13562-0_4",
language = "English",
isbn = "3642135617",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "28--39",
booktitle = "Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings",
note = "7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010 ; Conference date: 07-06-2010 Through 11-06-2010",

}

RIS

TY - GEN

T1 - Optimal acceptors and optimal proof systems

AU - Hirsch, Edward A.

PY - 2010/7/15

Y1 - 2010/7/15

N2 - Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-tautologies (with no time restriction). Unless we resolve the co-NP vs NP question, we are unable to say whether there is a proof system that has a polynomial-size proof for every tautology. In such a situation, it is typical for complexity theorists to search for "universal" objects; here, it could be the "fastest" acceptor (called optimal acceptor) and a proof system that has the "shortest" proof (called optimal proof system) for every tautology. Neither of these objects is known to the date. In this survey we review the connections between these questions and generalizations of acceptors and proof systems that lead or may lead to universal objects.

AB - Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-tautologies (with no time restriction). Unless we resolve the co-NP vs NP question, we are unable to say whether there is a proof system that has a polynomial-size proof for every tautology. In such a situation, it is typical for complexity theorists to search for "universal" objects; here, it could be the "fastest" acceptor (called optimal acceptor) and a proof system that has the "shortest" proof (called optimal proof system) for every tautology. Neither of these objects is known to the date. In this survey we review the connections between these questions and generalizations of acceptors and proof systems that lead or may lead to universal objects.

UR - http://www.scopus.com/inward/record.url?scp=77954436597&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-13562-0_4

DO - 10.1007/978-3-642-13562-0_4

M3 - Conference contribution

AN - SCOPUS:77954436597

SN - 3642135617

SN - 9783642135613

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 28

EP - 39

BT - Theory and Applications of Models of Computation - 7th Annual Conference, TAMC 2010, Proceedings

T2 - 7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010

Y2 - 7 June 2010 through 11 June 2010

ER -

ID: 49827737