Skip to content
VuFind
  • Login
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
Advanced
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Save to List
  • Permanent link
Cover Image

Saved in:
Bibliographic Details
Main Author: Schenk, Philipp
Format: Recurso digital
Language:
Published: Zenodo 2025
Subjects:
deterministic decision
P vs NP
PvsNP
SAT
restriction signatures
partial assignments
self-reducibility
residual decision behavior
decision without state
information incompression
structural complexity theory
descriptive complexity
fixed-point logic
proof complexity
Tseitin contradictions
CFI constructions
decision stability
polynomial time
complexity theory foundations
Online Access:https://doi.org/10.5281/zenodo.18027205
Tags: Add Tag
No Tags, Be the first to tag this record!
  • Holdings
  • Description
  • Table of Contents
  • Comments
  • Similar Items
  • Staff View

Internet

https://doi.org/10.5281/zenodo.18027205

Similar Items

  • Resolution of P ̸= NP: Compression Barriers, Non-Relativizing Arguments, and Entropy Formalization
    by: Fisher, Christopher
    Published: (2025)
  • Resolution of P ̸= NP: Compression Barriers, Non-Relativizing Arguments, and Entropy Formalization
    by: Fisher, Christopher
    Published: (2025)
  • NP vs. coNP as an Observer Constraint: A Physics-Informed Framework
    by: Fernandes, Ricardo Miguel Machado
    Published: (2025)
  • P ≠ NP: A Proof via Information Flow Complexity
    by: Christian Kilpatrick
    Published: (2025)
  • Work engagement: a study of daily changes
    by: Renata Silva de Carvalho Chinelato
    Published: (2019)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs