Listing graphs that satisfy first-order sentences

Authors:
Leslie Ann Goldberg
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1994

Citing 6
Cited 3

A zero-one law for logic with a fixed-point operator

Information and Control
Constructive combinatorics

Constructive combinatorics
Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
On sets polynomially enumerable by iteration

MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
Efficient algorithms for listing unlabeled graphs

Journal of Algorithms
Toward a Theory of Enumerations

Journal of the ACM (JACM)

Semi-Inflationary DATALOG: A declarative database language with procedural features

AI Communications
First-order queries on structures of bounded degree are computable with constant delay

ACM Transactions on Computational Logic (TOCL)
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple new construction of a pseudorandom bit generator. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g., P, NC, PSPACE, ...) using an arbitrary function ...