default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 39 matches
- 2024
- Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized problems complete for nondeterministic FPT time and logarithmic space. Inf. Comput. 300: 105195 (2024) - Matthew Abate, Mark Mote, Mehregan Dor, Corbin Klett, Sean Phillips, Kendra Lang, Panagiotis Tsiotras, Eric Feron, Samuel Coogan:
Run Time Assurance for Spacecraft Attitude Control Under Nondeterministic Assumptions. IEEE Trans. Control. Syst. Technol. 32(3): 862-873 (2024) - 2023
- Mikhail Moshkov:
Time and space complexity of deterministic and nondeterministic decision trees. Ann. Math. Artif. Intell. 91(1): 45-74 (2023) - Kerven Durdymyradov, Mikhail Moshkov:
Time and Space Complexity of Deterministic and Nondeterministic Decision Trees: Local Approach. IEEE Big Data 2023: 6040-6045 - Kerven Durdymyradov, Mikhail Moshkov:
A Local Approach to Studying the Time and Space Complexity of Deterministic and Nondeterministic Decision Trees. CoRR abs/2311.17306 (2023) - 2022
- Mikhail Moshkov:
Time and space complexity of deterministic and nondeterministic decision trees. CoRR abs/2201.01013 (2022) - 2021
- Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS 2021: 193-204 - Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. CoRR abs/2105.14882 (2021) - 2020
- Tsunehiro Yoshinaga, Makoto Sakamoto:
Non-Closure Properties of Multi-Inkdot Nondeterministic Turing Machines with Sublogarithmic Space. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1234-1236 (2020) - 2017
- Artur Jez:
Word Equations in Nondeterministic Linear Space. ICALP 2017: 95:1-95:13 - 2010
- Tsunehiro Yoshinaga, Jianliang Xu, Makoto Sakamoto:
Non-closure Properties of 1-Inkdot Nondeterministic Turing Machines and Alternating Turing Machines with Only Universal States Using Small Space. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(6): 1148-1152 (2010) - Nicola Caporaso:
Is Space a Stronger Resource than Time? Positive Answer for the Nondeterministic at-Least-Quadratic Time Case. CoRR abs/1001.4649 (2010) - 2009
- Stasys Jukna:
A nondeterministic space-time tradeoff for linear codes. Inf. Process. Lett. 109(5): 286-289 (2009) - 2006
- Philippe Chapdelaine, Etienne Grandjean:
Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes. CoRR abs/cs/0606058 (2006) - 2000
- Lance Fortnow, Dieter van Melkebeek:
Time-Space Tradeoffs for Nondeterministic Computation. CCC 2000: 2-13 - Lance Fortnow, Dieter van Melkebeek:
Time-Space Tradeoffs for Nondeterministic Computation. Electron. Colloquium Comput. Complex. TR00 (2000) - 1997
- Lance Fortnow:
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability. CCC 1997: 52-60 - 1995
- Ee-Chien Chang, Chee-Keng Yap:
A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space. Inf. Process. Lett. 55(3): 155-157 (1995) - 1994
- Juraj Hromkovic, Branislav Rovan, Anna Slobodová:
Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines. Theor. Comput. Sci. 132(2): 319-336 (1994) - Marty J. Wolf:
Nondeterministic Circuits, Space Complexity and Quasigroups. Theor. Comput. Sci. 125(2): 295-313 (1994) - 1993
- Katsushi Inoue, Akira Ito, Itsuo Takanami, Tsunehiro Yoshinaga:
A Note on Multi-Inkdot Nondeterministic Turing Machines with Small Space. Inf. Process. Lett. 48(6): 285-288 (1993) - Juraj Hromkovic, Branislav Rovan, Anna Slobodová:
Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines. Developments in Language Theory 1993: 314-325 - Hiroaki Yamamoto:
Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines. ICALP 1993: 203-214 - 1992
- Helmut Alt, Viliam Geffert, Kurt Mehlhorn:
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. Inf. Process. Lett. 42(1): 25-27 (1992) - Katsushi Inoue, Akira Ito, Itsuo Takanami:
A Relationship Between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space. Inf. Process. Lett. 43(4): 225-227 (1992) - 1991
- Viliam Geffert:
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. SIAM J. Comput. 20(3): 484-498 (1991) - 1990
- Yuri Gurevich, Saharon Shelah:
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space. J. ACM 37(3): 674-687 (1990) - Andrzej Szepietowski:
If Deterministic and Nondeterministic Space Complexities are Equal for log log n, then they are also Equal for log n. Theor. Comput. Sci. 74(1): 115-119 (1990) - Viliam Geffert:
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. ICALP 1990: 111-124 - John G. Geske, Diane Kakihara:
Almost-Everywhere Complexity, Bi-Immunity and Nondeterministic Space. ICCI 1990: 44-51
skipping 9 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-24 06:28 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint