Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories

AuthID
 P-010-0Y6
5
Author(s)
Antonelli, M
·
Dal Lago, U
·
Davoli, D
·
Pistone, P
2
Editor(es)
Murano,A;Silva,A
Tipo de Documento
Proceedings Paper
Year published
2024
Publicado
in 32ND EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC, CSL 2024 in Leibniz International Proceedings in Informatics, ISSN: 1868-8969
Volume: 288
Conference
32Nd Eacsl Annual Conference on Computer Science Logic (Csl), Date: FEB 19-23, 2024, Location: Naples, ITALY
Indexing
Wos®
Scopus®
Google Scholar®
Publication Identifiers
SCOPUS: 2-s2.0-85185217364
Wos: WOS:001300390800010
Source Identifiers
ISSN: 1868-8969
Export Publication Metadata
Lista Marked
 Adicionar à lista Marked
Citações
Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

CORE Conference
No information about CORE Rank

During the preprocessing phase, only publications of type 'Proceedings Paper' or 'Proceedings' are automatically processed to identify their CORE Rank.

TIP: If your publication's CORE Rank is missing, you can contact with your institutional manager to have the correct ranking manually added to the record.

Journal Factors
Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

Full Text
Full Text @ sfx.b-on.pt

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2026 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service