53 research outputs found
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
AbstractWe show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be recognized by a width-5 polynomial-size branching program. As any bounded-width polynomial-size branching program can be simulated by an NC1 circuit, we have that the class of languages recognized by such programs is exactly nonuniform NC1. Further, following Ruzzo (J. Comput. System Sci. 22 (1981), 365–383) and Cook (Inform. and Control 64 (1985) 2–22), if the branching programs are restricted to be ATIME(logn)-uniform, they recognize the same languages as do ATIME(log n)-uniform NC1 circuits, that is, those languages in ATIME(log n). We also extend the method of proof to investigate the complexity of the word problem for a fixed permutation group and show that polynomial size circuits of width 4 also recognize exactly nonuniform NC1
Kolmogorov Complexity Characterizes Statistical Zero Knowledge
We show that a decidable promise problem has a non-interactive statistical zero-knowledge proof system if and only if it is randomly reducible via an honest polynomial-time reduction to a promise problem for Kolmogorov-random strings, with a superlogarithmic additive approximation term. This extends recent work by Saks and Santhanam (CCC 2022). We build on this to give new characterizations of Statistical Zero Knowledge SZK, as well as the related classes NISZK_L and SZK_L
On relation classes and solution relations
Die Dissertation On Relation Classes and Solution Relations ist in dem Gebiet der strukturellen Komplexitätstheorie einzuordnen. In einem ersten Teil wird die vollständige Inklusionsstruktur zwischen verschiedenen Relationenklassen aufgeklärt. Ein Großteil der Ergebnisse wird dabei mit Hilfe der Operatorenmethode erzielt. Im zweiten Teil werden Lösungsrelationen und easy-Sprachen betrachtet. Es wird der Fragestellung nachgegangen, welche Probleme durch eine vorgegebene Klasse von Relationen gelöst werden können
Robustness for Space-Bounded Statistical Zero Knowledge
We show that the space-bounded Statistical Zero Knowledge classes SZK_L and NISZK_L are surprisingly robust, in that the power of the verifier and simulator can be strengthened or weakened without affecting the resulting class. Coupled with other recent characterizations of these classes [Eric Allender et al., 2023], this can be viewed as lending support to the conjecture that these classes may coincide with the non-space-bounded classes SZK and NISZK, respectively
Restricted branching programs and hardware verification
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.Includes bibliographical references (p. 71-77).by Stephen John Ponzio.Ph.D
Definability by constant-depth polynomial-size circuits
A function of boolean arguments is symmetric if its value depends solely on the number of 1's among its arguments. In the first part of this paper we partially characterize those symmetric functions that can be computed by constant-depth polynomial-size sequences of boolean circuits, and discuss the complete characterization. (We treat both uniform and non-uniform sequences of circuits.) Our results imply that these circuits can compute functions that are not definable in first-order logic. In the second part of the paper we generalize from circuits computing symmetric functions to circuits recognizing first-order structures. By imposing fairly natural restrictions we develop a circuit model with precisely the power of first-order logic: a class of structures is first-order definable if and only if it can be recognized by a constant-depth polynomial-time sequence of such circuits.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/26084/1/0000160.pd
- …