A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Separating Nondeterministic Time Complexity Classes

1978
*
Journal of the ACM
*

Our main results generalize Cook's theorem, even

doi:10.1145/322047.322061
fatcat:4ktvlqjhjfef7odqak37r7sszq
*separating*the class This paper represents a portion of the first author's Ph D d~ssertatlon [25] written at M.I.T. ... A recurslve padding technique is used to obtain conditions sufficient for*separation*of nondetermlmsttc multltape Turlng machine time complexity classes If T2 is a running time and Tl(n + 1) grows more ...*Separating**Nondeterministic*Time Complexity Classes 147 NTIME(n r) of languages accepted by*nondeterministic*Turing machines within time n r from classes as large as NTIME(n~/Iog log log n), for example ...##
###
Separating Input/Output Automata With Nondeterministic Behavior

2020
*
Russian Digital Libraries Journal
*

In order to do this, proper

doi:10.26907/1562-5419-2020-23-4-634-655
fatcat:rqiqzhr7ibc6tj7wynivabdrzu
*separating*sequences are utilized. ... Such sequences are well studied for complete and deterministic Finite State Machines but components of control systems can be only partially described and their behavior can be*nondeterministic*. ...##
###
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
[chapter]

2009
*
Lecture Notes in Computer Science
*

We investigate the question whether NE can be

doi:10.1007/978-3-642-02882-3_48
fatcat:i2fnyoy3cbafbh3qma6onx25v4
*separated*from the reduction closures of tally sets, sparse sets and NP. ... Introduction This paper continues a line of research that tries to*separate**nondeterministic*complexity classes in a stronger sense, i.e.,*separating**nondeterministic*complexity classes from the reduction ... Conclusions We derived some*separations*between NE and other*nondeterministic*complexity classes. ...##
###
Improved Separations between Nondeterministic and Randomized Multiparty Communication

2009
*
ACM Transactions on Computation Theory
*

We exhibit an explicit function f : {0, 1} n → {0, 1} that can be computed by a

doi:10.1145/1595391.1595392
fatcat:mcltf74b35a6dcbhxfflwwtpmu
*nondeterministic*number-on-forehead protocol communicating O(log n) bits, but that requires n Ω(1) bits of communication ... Recent breakthrough results for the Set-Disjointness function (Sherstov, STOC '08; Lee Shraibman, CCC '08; Chattopadhyay Ada, ECCC '08) imply such a*separation*but only when the number of players is k ... Non-explicit*Separation*In this section we prove a non-explicit*separation*between*nondeterministic*and randomized protocols. ...##
###
Separation of deterministic, nondeterministic and alternating complexity classes

1991
*
Theoretical Computer Science
*

Stefinekovi,

doi:10.1016/0304-3975(91)90379-g
fatcat:3wlljrk775aj3cuhio7nqekn2u
*Separation*of deterministic,*nondeterministic*and alternating complexity classes, Theoretical Computer Science 88 (1991) 297-311. ... In this paper*nondeterministic*and deterministic complexity classes as well as alternating and*nondeterministic*complexity classes for one-head and multihead Turing machines are*separated*, while as a complexity ... In this work we*separate*nondeterminism from alternation and determinism from nondeterminism for one-head and multihead Turing machines (TM). ...##
###
Separating NE from some nonuniform nondeterministic complexity classes

2010
*
Journal of combinatorial optimization
*

We investigate the question whether NE can be

doi:10.1007/s10878-010-9327-5
fatcat:uqe57n65srbypnudjs3si5slli
*separated*from the reduction closures of tally sets, sparse sets and NP. ... This paper continues a line of research that tries to*separate**nondeterministic*complexity classes in a stronger sense, i.e.,*separating**nondeterministic*complexity classes from the reduction closure of ... Conclusions We derived some*separations*between NE and other*nondeterministic*complexity classes. ...##
###
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
[article]

2010
*
arXiv
*
pre-print

We strengthen the result to obtain a stronger

arXiv:1004.3993v1
fatcat:xoba4bfst5btjptjxfj6xcelmu
*separation*between deterministic time classes and*nondeterministic*time classes. ... Introduction Hartmanis [3] used time-bounded Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay [1] that there is an oracle*separating*P and NP. ...##
###
Testing Nondeterministic Finite State Machines with Respect to the Separability Relation
[chapter]

2007
*
Lecture Notes in Computer Science
*

A (complete) test suite derived from the given (

doi:10.1007/978-3-540-73066-8_21
fatcat:co53k2cknrglbm2fr6ytccqy2i
*nondeterministic*) FSM specification using the*separability*relation can detect every IUT that is*separable*from the given specification after applying each ... In this paper, we propose a fault model and a method for deriving complete test suites for*nondeterministic*FSMs with respect to the*separability*relation. ... The relation «not a reduction» contains the*separability*relation, i.e. for*nondeterministic*FSMs ≁ ⊆ ≰ . ...##
###
Separation and lower bounds for ROM and nondeterministic models of parallel computation

1987
*
Information and Computation
*

We prove a

doi:10.1016/0890-5401(87)90017-4
fatcat:hgbu7k6kjrf4hhaqquzzqsg7ae
*nondeterministic*upper bound of O(n'/l). ... We also prove a tight lower bound of Q(A) for PARITY on*nondeterministic*PRIORITY( 1) without ROM and a lower bound of Q(log log n) for PARITY on*nondeterministic*PRIORITY( 1) with ROM. ( ' lY87 Academic ... We also treat*nondeterministic*models. ...##
###
TEST SUITES DERIVATION FOR NONDETERMINISTIC FINITE STATE MASHINES WITH RESPECT TO THE SEPARABILITY RELATION

К ПОСТРОЕНИЮ ПРОВЕРЯЮЩИХ ТЕСТОВ ОТНОСИТЕЛЬНО НЕРАЗДЕЛИМОСТИ ДЛЯ НЕДЕТЕРМИНИРОВАННЫХ АВТОМАТОВ

2009
*
PRIKLADNAYa DISKRETNAYa MATEMATIKA
*

К ПОСТРОЕНИЮ ПРОВЕРЯЮЩИХ ТЕСТОВ ОТНОСИТЕЛЬНО НЕРАЗДЕЛИМОСТИ ДЛЯ НЕДЕТЕРМИНИРОВАННЫХ АВТОМАТОВ

Предлагается способ улучшения метода построения тестов для недетерминированных автоматов относительно неразделимости. Показывается, что тест, построенный согласно модифицированному методу, будет по-прежнему полным, но при этом менее избыточным. Ключевые слова: недетерминированный автомат, отношение неразделимости, полный проверяющий тест. 1 Работа выполнена при поддержке ФЦП Исследования и разработки по приоритетным направлениям развития научно-технологического комплекса России на 2007-2012

doi:10.17223/20710410/5/12
fatcat:tz6ahkv6yzbshjauqclpasxtqy
## more »

... ии на 2007-2012 годы , ГК № 02.514.12.4002.##
###
On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines

1989
*
Journal of computer and system sciences (Print)
*

Using the equivalence we prove an almost linear lower bound for the size of

doi:10.1016/0022-0000(89)90036-6
fatcat:joloongagndvfihryhkld3adke
*separators*for 3-pushdown graphs and an almost quadratic lower bound for simulating two-tape*nondeterministic*Turing machines ... We show that the following statements are equivalent: Statement 1. 3-pushdown graphs have sublinear*separators*. Statement l*. k-page graphs have sublinear*separators*. Statement 2. ... Any*nondeterministic*two-tape machine can be simulated in real time by a*nondeterministic*three-pushdown machine [Z] . ...##
###
On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines

1986
*
Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
*

Using the equivalence we prove an almost linear lower bound for the size of

doi:10.1145/12130.12135
dblp:conf/stoc/GalilKS86
fatcat:bgvmrnlvqjbercxepmmca44ezu
*separators*for 3-pushdown graphs and an almost quadratic lower bound for simulating two-tape*nondeterministic*Turing machines ... -There is a language L recognizable in real time by a two-tape*nondeterministic*Turing machine, but every on-line one-tape*nondeterministic*Turing machine that recognizes L requires 0. ... (Recall that }vI' is*nondeterministic*.) ...##
###
Improved Separations between Nondeterministic and Randomized Multiparty Communication
[chapter]

*
Lecture Notes in Computer Science
*

We exhibit an explicit function f : {0, 1} n → {0, 1} that can be computed by a

doi:10.1007/978-3-540-85363-3_30
fatcat:jvu6zxi4rvdhdo6ev6mtl4sfcu
*nondeterministic*number-on-forehead protocol communicating O(log n) bits, but that requires n Ω(1) bits of communication ... Recent breakthrough results for the Set-Disjointness function (Sherstov, STOC '08; Lee Shraibman, CCC '08; Chattopadhyay Ada, ECCC '08) imply such a*separation*but only when the number of players is k ... Non-explicit*Separation*In this section we prove a non-explicit*separation*between*nondeterministic*and randomized protocols. ...##
###
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
[chapter]

*
Lecture Notes in Computer Science
*

This

doi:10.1007/978-3-540-73420-8_14
fatcat:rtsck7k6ifeb5oopilfadmyj64
*separates*the analogues of RP and P in the NOF communication model. ... Our lower bounds are existential and we do not know of any explicit function which allows such*separations*. ... The problem of*separating*deterministic from*nondeterministic*NOF complexity is particularly interesting because of its connection to proof complexity. ...##
###
Quantum weakly nondeterministic communication complexity

2013
*
Theoretical Computer Science
*

More precisely, we show the first

doi:10.1016/j.tcs.2012.12.015
fatcat:fs6sk76p5zf2fapaenpq4jfzca
*separation*, for a total function, of quantum weakly*nondeterministic*and classical*nondeterministic*communication complexity. ... This*separation*is quadratic and shows than classical proofs can be checked more efficiently by quantum protocols than by classical ones, in the framework of communication complexity. ... Corollary 1 There is a quadratic*separation*of quantum weakly*nondeterministic*and classical*nondeterministic*communication complexity. Proof. ...
« Previous

*Showing results 1 — 15 out of 29,754 results*