Back to Results
First PageMeta Content
Complexity classes / Structural complexity theory / Mathematical optimization / Probabilistic complexity theory / NP / P versus NP problem / Propositional proof system / PP / Mathematical proof / Theoretical computer science / Computational complexity theory / Applied mathematics


Optimal acceptors and optimal proof systems Edward A. Hirsch? Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St. Petersburg[removed], Russia http://logic.pdmi.ras.ru/~hirsch/
Add to Reading List

Document Date: 2010-03-28 09:40:37


Open Document

File Size: 197,46 KB

Share Result on Facebook

Country

Russia / /

Facility

Steklov Institute of Mathematics / /

IndustryTerm

propositional proof systems / decision algorithms / decision algorithm / sound proof systems / heuristic automatizable proof systems / heuristic proof systems / search-to-decision reduction / automatizable proof systems / heuristic algorithms / polynomial-time algorithm / deterministic algorithm / p-optimal algorithms / proof systems / enumeration algorithm / p-optimal proof systems / search algorithms / automatizable heuristic proof systems / /

Organization

Steklov Institute of Mathematics / /

Person

Messner / Edward A. Hirsch / Santhanam / Ai / /

Position

president / /

Technology

decision algorithms / enumeration algorithm / randomized algorithm / following algorithm / search algorithms / polynomial-time algorithm / deterministic algorithm / simulation / decision algorithm / /

URL

http /

SocialTag