Near-testable sets

SIAM Journal on Computing

Volumn 20, Issue 3, 1991, Pages 506-523

  Goldsmith, Judy ^a   Hemachandra, Lane A ^a   Joseph, Deborah ^a   Young, Paul ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - COMPUTATIONAL COMPLEXITY; MATHEMATICAL TECHNIQUES - SET THEORY;

ISOMORPHISM; NEAR TESTABLE SETS; PARITY POLYNOMIAL TIME; POLYNOMIAL TIME REDUCTIONS; SELF REDUCIBILITY; STRUCTURAL COMPLEXITY THEORY;

AUTOMATA THEORY;

EID: 0026171047     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/0220033     Document Type: Article

References (36)