Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
nondeterministic computation
Description:
A model of computation in theoretical computer science that allows multiple possible computational paths from a given state.
Related topics:
Logic, programming, and type systems (20%),
Complexity and Algorithms in Graphs (18%),
Computability, Logic, AI Algorithms (14%),
semigroups and automata theory (14%),
DNA and Biological Computing (9%)
Wikidata ID:
wiki/Q3490301
OpenAlex ID:
keywords/nondeterministic-computation
Checking computations in polylogarithmic time
1991
·
László Babai
, Lance Fortnow
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
745
PDF
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
1982
·
Kurt Mehlhorn
, Erik M. Schmidt
·
ACM Symposium on Theory of Computing (STOC)
·
296
PDF
Computational complexity of real functions
1982
·
Ker-I. Ko
, Harvey Friedman
·
Theoretical Computer Science
·
286
Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility
2016
·
Marco L. Carmosino
, Jiawei Gao
, et al.
·
Conference on Innovations in Theoretical Computer Science
·
184
PDF
Non-Deterministic Semantics for Logical Systems
2010
·
Arnon Avron
, Anna Zamansky
·
Springer eBooks
·
166
Lower bounds for VLSI
1981
·
Richard J. Lipton
, Robert Sedgewick
·
ACM Symposium on Theory of Computing (STOC)
·
166
On determinism versus non-determinism and related problems
1983
·
Wolfgang J. Paul
, Nicholas Pippenger
, et al.
·
Annual Symposium on Foundations of Computer Science
·
161
Spiking Neural P Systems with Weights
2010
·
Jun Wang
, Hendrik Jan Hoogeboom
, et al.
·
Neural Computation
·
148
PDF
ELAN from a rewriting logic point of view
2002
·
Peter Borovanský
, Claude Kirchner
, et al.
·
Theoretical Computer Science
·
144
PDF
Spiking neural P systems with structural plasticity
2015
·
Francis George C. Cabarle
, Henry N. Adorna
, et al.
·
Neural Computing and Applications
·
140
A characterization of the power of vector machines
1976
·
Vaughan R. Pratt
, Larry J. Stockmeyer
·
Journal of Computer and System Sciences
·
138
The Minimum Equivalent DNF Problem and Shortest Implicants
2001
·
Christopher Umans
·
Journal of Computer and System Sciences
·
137
PDF
Making Nondeterminism Unambiguous
2000
·
Klaus Reinhardt
, Eric Allender
·
SIAM Journal on Computing
·
136
ELAN
1996
·
Peter Borovanský
, Claude Kirchner
, et al.
·
Electronic Notes in Theoretical Computer Science
·
133
Sparse sets in NP-P: EXPTIME versus NEXPTIME
1985
·
J. Hartmanis
, N. Immerman
, et al.
·
Information and Control
·
132
Closed choice and a Uniform Low Basis Theorem
2012
·
Vasco Brattka
, Matthew de Brecht
, et al.
·
Annals of Pure and Applied Logic
·
127
PDF
Uniform solutions to SAT and Subset Sum by spiking neural P systems
2008
·
Alberto Leporati
, Giancarlo Mauri
, et al.
·
Natural Computing
·
127
Halting space-bounded computations
1980
·
Michael Sipser
·
Theoretical Computer Science
·
125
PDF
Functional Unification Grammar: a formalism for machine translation
1984
·
Martin Kay
·
Proceedings of the conference - Association for Computational Linguistics. Meeting
·
112
Flexible and Efficient Verifiable Computation on Encrypted Data
2021
·
Alexandre Bois
, Ignacio Cascudo
, et al.
·
Lecture notes in computer science
·
95
On the power of parity polynomial time
1990
·
Jin-yi Cai
, Lane A. Hemachandra
·
Theory of Computing Systems
·
94
Simulation of P systems with active membranes on CUDA
2009
·
J. M. Cecilia
, J. M. Garcia
, et al.
·
Briefings in Bioinformatics
·
90
PDF
Enumeration reducibility, nondeterministic computations and relative computability of partial functions
1990
·
S. Barry Cooper
·
Lecture notes in mathematics
·
90
Short propositional formulas represent nondeterministic computations
1988
·
Stephen A. Cook
·
Information Processing Letters
·
88
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
1980
·
Chandra M. R. Kintala
, Patrick C. Fischer
·
SIAM Journal on Computing
·
87
Show more works
View as search
Works count:
698
Citation count:
10,070
Year
Topic
Type