The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds ; volume:3 ; year:2024
TheoretiCS ; 3 (2024)

Classification: Informatik

Creator: Bringmann, Karl
Grønlund, Allan
Künnemann, Marvin
Larsen, Kasper Green

Contributor: Saarland University and Max-Planck-Institute for Informatics, Saarland Informatics Campus
Aarhus University and Kvantify
Karlsruhe Institute of Technology

DOI: 10.46298/theoretics.24.22

URN: urn:nbn:de:101:1-2501271138195.164444101902

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 15.08.2025, 7:22 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Bringmann, Karl
Grønlund, Allan
Künnemann, Marvin
Larsen, Kasper Green
Saarland University and Max-Planck-Institute for Informatics, Saarland Informatics Campus
Aarhus University and Kvantify
Karlsruhe Institute of Technology

Other Objects (12)

Arbeitspapier

Hypothesis Testing for Arbitrary Bounds

Proportionality’s Lower Bound

zweidimensionales bewegtes Bild

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Hochschulschrift

Lower Bounds for Heuristic Algorithms

Treewidth Lower Bounds with Brambles

Maximum common subgraph: some upper bound and lower bound results

Hochschulschrift

Lower bounds for Auslander's representation dimension

Arbeitspapier

Zero Lower Bound on Inflation Expectations

zweidimensionales bewegtes Bild

Resolution Lower Bounds for Refutation Statements

Arbeitspapier

Inequality and the Zero Lower Bound

Arbeitspapier

Hypothesis Testing for Arbitrary Bounds

Proportionality’s Lower Bound

zweidimensionales bewegtes Bild

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Hochschulschrift

Lower Bounds for Heuristic Algorithms

Treewidth Lower Bounds with Brambles

Maximum common subgraph: some upper bound and lower bound results

Hochschulschrift

Lower bounds for Auslander's representation dimension

Arbeitspapier

Zero Lower Bound on Inflation Expectations

zweidimensionales bewegtes Bild

Resolution Lower Bounds for Refutation Statements

Arbeitspapier

Inequality and the Zero Lower Bound

Arbeitspapier

Hypothesis Testing for Arbitrary Bounds

Proportionality’s Lower Bound

zweidimensionales bewegtes Bild

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Hochschulschrift

Lower Bounds for Heuristic Algorithms

Treewidth Lower Bounds with Brambles

Maximum common subgraph: some upper bound and lower bound results

Hochschulschrift

Lower bounds for Auslander's representation dimension

Arbeitspapier

Zero Lower Bound on Inflation Expectations

zweidimensionales bewegtes Bild

Resolution Lower Bounds for Refutation Statements

Arbeitspapier

Inequality and the Zero Lower Bound

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (12)

Hypothesis Testing for Arbitrary Bounds

Proportionality’s Lower Bound

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Lower Bounds for Heuristic Algorithms

Treewidth Lower Bounds with Brambles

Maximum common subgraph: some upper bound and lower bound results

Lower bounds for Auslander's representation dimension

Zero Lower Bound on Inflation Expectations

Resolution Lower Bounds for Refutation Statements

Inequality and the Zero Lower Bound

Hypothesis Testing for Arbitrary Bounds

Proportionality’s Lower Bound

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Lower Bounds for Heuristic Algorithms

Treewidth Lower Bounds with Brambles

Maximum common subgraph: some upper bound and lower bound results

Lower bounds for Auslander's representation dimension

Zero Lower Bound on Inflation Expectations

Resolution Lower Bounds for Refutation Statements

Inequality and the Zero Lower Bound

Hypothesis Testing for Arbitrary Bounds

Proportionality’s Lower Bound

Guaranteed lower bounds for eigenvalues

Lower bounds for RCPSP-max

Lower Bound Functions for Polynomials

Lower Bounds for Heuristic Algorithms

Treewidth Lower Bounds with Brambles

Maximum common subgraph: some upper bound and lower bound results

Lower bounds for Auslander's representation dimension

Zero Lower Bound on Inflation Expectations

Resolution Lower Bounds for Refutation Statements

Inequality and the Zero Lower Bound

Related objects

Reset password