Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Proof complexity of positive branching programs

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2025
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030188770164736
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:5247
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2025
publishDateSort 2025
record_format rss_article
spellingShingle Proof complexity of positive branching programs
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Proof complexity of positive branching programs
title_auth Proof complexity of positive branching programs
title_full Proof complexity of positive branching programs
title_fullStr Proof complexity of positive branching programs
title_full_unstemmed Proof complexity of positive branching programs
title_short Proof complexity of positive branching programs
title_sort proof complexity of positive branching programs
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.46298/lmcs-21(1:23)2025