Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Logical Approaches to Computational Barriers

From MaRDI portal
Publication:5898808
Jump to:navigation, search

DOI10.1007/11780342zbMath1145.03334OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898808

Stefan S. Dantchev

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342


zbMATH Keywords

Constant-Depth FregePigeon-Hole PrinciplePropositional Proof ComplexityQuery ComplexitySearch ProblemsSperner Lemma


Mathematics Subject Classification ID

Complexity of proofs (03F20)








This page was built for publication: Logical Approaches to Computational Barriers

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5898808&oldid=16738824"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 19:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki