Find link

language:

Find link is a tool written by Edward Betts.

searching for Proof complexity 14 found (34 total)

Probabilistically checkable proof (1,237 words) [view diff] no match in snippet view article find links to article

In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a

Grigori Tseitin (313 words) [view diff] exact match in snippet view article find links to article

transformation used in SAT solvers, Tseitin tautologies used in the proof complexity theory, and for his work on Algol 68. Tseitin studied Mathematics at

Gaisi Takeuti (408 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-981-238-279-5, MR 1984952 Sam Buss (2017-05-10). "[Proof Complexity] Gaisi Takeuti". Proof-Complexity mailing list. Retrieved 2019-01-13. Takeuti 2013.

Ultrafinitism (903 words) [view diff] case mismatch in snippet view article find links to article

Troelstra Predicative Arithmetic by Edward Nelson Logical Foundations of Proof Complexity by Stephen A. Cook and Phuong The Nguyen Bounded Reverse Mathematics

Knuth Prize (761 words) [view diff] exact match in snippet view article find links to article

including randomized computation, cryptography, circuit complexity, proof complexity, parallel computation, and our understanding of fundamental graph properties"

Russell Impagliazzo (816 words) [view diff] exact match in snippet view article find links to article

Computing named a 2004 Guggenheim fellow for work on "heuristics, proof complexity, and algorithmic techniques" "Russell Impagliazzo - The Mathematics

Alexander Razborov (716 words) [view diff] exact match in snippet view article find links to article

S2CID 8130114. Razborov, Alexander A. (January 2003). "Propositional proof complexity" (PostScript). Journal of the ACM. 50 (1): 80–82. doi:10.1145/602382

Pebble game (763 words) [view diff] case mismatch in snippet view article find links to article

Foundations of Computer Science, Japan. Jakob Nordström. Pebble Games, Proof Complexity, and Time-Space Trade-offs. Logical Methods in Computer Science, volume

Regular language (3,414 words) [view diff] exact match in snippet view article find links to article

S2CID 14677270. Cook, Stephen; Nguyen, Phuong (2010). Logical foundations of proof complexity (1. publ. ed.). Ithaca, NY: Association for Symbolic Logic. p. 75.

Horn-satisfiability (1,048 words) [view diff] exact match in snippet view article find links to article

2-satisfiability Stephen Cook; Phuong Nguyen (2010). Logical foundations of proof complexity. Cambridge University Press. p. 224. ISBN 978-0-521-51729-4. (Author's

Samuelson–Berkowitz algorithm (665 words) [view diff] case mismatch in snippet view article find links to article

1016/0020-0190(84)90018-8. Soltys, Michael; Cook, Stephen (December 2004). "The Proof Complexity of Linear Algebra" (PDF). Annals of Pure and Applied Logic. 130 (1–3):

List of Guggenheim Fellowships awarded in 2004 (3,943 words) [view diff] exact match in snippet view article find links to article

and Engineering, University of California, San Diego: Heuristics, proof complexity, and algorithmic techniques. Lawson Fusao Inada, Poet, Medford, Oregon;

List of University of Michigan alumni (24,232 words) [view diff] exact match in snippet view article find links to article

has made major contributions to the fields of complexity theory and proof complexity as a Turing Award Winner Edward S. Davidson, IEEE Fellow; 2000 IEEE/ACM

List of women in mathematics (22,165 words) [view diff] exact match in snippet view article find links to article

Pitassi, American-Canadian computational complexity theorist, expert on proof complexity Shirley Pledger, New Zealand mathematician and statistician known for