Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Browse subjects
  3. Computer Science
  4. Algorithmics, Complexity, Computer Algebra, Computational Geometry
  5. Content listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

6848 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry

Page 1 of 343

Quantum Computing for Programmers
  • 2nd edition
  • Robert Hundt
  • Coming soon
  • Expected online publication date:
    November 2025
    Print publication:
    30 November 2025

Syntax and Semantics of Petri Nets
  • Roberto Gorrieri
  • Coming soon
  • Expected online publication date:
    August 2025
    Print publication:
    31 August 2025
  • Petri nets are one of the most popular tools for modeling distributed systems. This book provides a modern look at the theory behind them, by studying three classes of nets that model (i) sequential systems, (ii) non-communicating parallel systems, and (iii) communicating parallel systems. A decidable and causality respecting behavioral equivalence is presented for each class, followed by a modal logic characterization for each equivalence. The author then introduces a suitable process algebra for the corresponding class of nets and proves that the behavioral equivalence proposed for each class is a congruence for the operator of the corresponding process algebra. Finally, an axiomatization of the behavioral congruence is proposed. The theory is introduced step by step, with ordinary-language explanations and examples provided throughout, to remain accessible to readers without specialized training in concurrency theory or formal logic. Exercises with solutions solidify understanding, and the final chapter hints at extensions of the theory.

  • 2 - The dWPHP Problem

  • Jan Krajíček, Charles University, Prague
  • Book:
    Proof Complexity Generators
    Published online:
    29 May 2025
    Print publication:
    26 June 2025, pp 6-15

  • Summary

    The chapter examines the motivational dWPHP problem from three perspectives: logical (axiomatization and provability), computational complexity (witnessing) and proof complexity (propositional translation). It also defines strong proof systems and formulates some of their properties.

  • 1 - Introduction

  • Jan Krajíček, Charles University, Prague
  • Book:
    Proof Complexity Generators
    Published online:
    29 May 2025
    Print publication:
    26 June 2025, pp 1-5

  • Summary

    The chapter gives the historic background in bounded arithmetic and describes how it lead to the development of the presented theory. It lists prerequisites and some notation and terminology to be used.

  • 3 - τ-Formulas and Generators

  • Jan Krajíček, Charles University, Prague
  • Book:
    Proof Complexity Generators
    Published online:
    29 May 2025
    Print publication:
    26 June 2025, pp 16-29

  • Summary

    The chapter defines the notion of a generator and its hardness, and formulates the hardness conjecture. It also defines a stronger notion of pseudosurjectivity of a generator and states the key conjecture about it. It examines some consequences of the two conjectures for the dWPHP problem. It also relates the hardness conjecture to feasible interpolation, gives a model-theoretic view of the issues and discusses a relation to pseudorandomness.

  • 8 - Consistency Results

  • Jan Krajíček, Charles University, Prague
  • Book:
    Proof Complexity Generators
    Published online:
    29 May 2025
    Print publication:
    26 June 2025, pp 75-92

  • Summary

    The chapter gives several consistency results related to the dWPHP problem. It also considers the hardness conjecture for feasibly infinite NP sets. It relates witnessing of dWPHP to various computational complexity conjectures.

  • 10 - Further Research

  • Jan Krajíček, Charles University, Prague
  • Book:
    Proof Complexity Generators
    Published online:
    29 May 2025
    Print publication:
    26 June 2025, pp 104-110

  • Summary

    This final chapter offers a number of topics for further research involving ordinary PHP, S-T computations, a new notion of PLS-infinite NP sets, proof search algorithms, an exponential time weakening of generators and the function inversion problem.

  • 7 - The Case of ER

  • Jan Krajíček, Charles University, Prague
  • Book:
    Proof Complexity Generators
    Published online:
    29 May 2025
    Print publication:
    26 June 2025, pp 58-74

  • Summary

    The chapter concentrates on the pivotal case of extended resolution. It recalls some characterizations of its lengths-of-proofs function and formulates a framework for lower bounds proofs using expansions of pseudofinite structures. It gives an example of a specific candidate construction.

  • 9 - Contexts

  • Jan Krajíček, Charles University, Prague
  • Book:
    Proof Complexity Generators
    Published online:
    29 May 2025
    Print publication:
    26 June 2025, pp 93-103

  • Summary

    The chapter presents several topics outside of the theory where some ideas and results around proof complexity generators appear to be relevant. These include SAT algorithms, the optimality problem of proof complexity, structured PHP approach, the incompleteness theorem and total NP search problems.

  • 4 - The Stretch

  • Jan Krajíček, Charles University, Prague
  • Book:
    Proof Complexity Generators
    Published online:
    29 May 2025
    Print publication:
    26 June 2025, pp 30-41

  • Summary

    The chapter examines possible stretch of generators and relates it to problems about Kolmogorov's complexity, the feasible disjunction property and to a related notion of disjunction hardness of generators. The truth-table function is presented as a key example of a generator and its hardness and pseudosurjectivity is considered. A problem about time-bounded Kolmogorov complexity is formulated.

Page 1 of 343