I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
On Bounded Depth Proofs for Tseitin Formulas on the Grid; R..:
, In:
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
,
Hastad, Johan
;
Risse, Kilian
- p. 1138-1149 , 2022
Link:
https://doi.org/10.1109/FOCS54457.2022.00110
RT T1 <cTitle>2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)</cTitle>: T1 <Title>On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-9996884&Exemplar=1&LAN=DE A1 Hastad, Johan A1 Risse, Kilian YR 2022 SN 2575-8454 K1 Computer science K1 Switches K1 Standards K1 proof complexity K1 bounded depth Frege SP 1138 OP 1149 LK http://dx.doi.org/https://doi.org/10.1109/FOCS54457.2022.00110 DO https://doi.org/10.1109/FOCS54457.2022.00110 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
