The following pages link to Ashok K. Chandra (Q913503):
Displaying 29 items.
- Communication complexity of PRAMs (Q913504) (← links)
- On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective (Q1055392) (← links)
- Unbounded fan-in circuits and associative functions (Q1083202) (← links)
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time (Q1144943) (← links)
- Computable queries for relational data bases (Q1151060) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Inherently nonplanar automata (Q1217777) (← links)
- On the number of prime implicants (Q1251656) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- (Q1838839) (redirect page) (← links)
- Structure and complexity of relational queries (Q1838840) (← links)
- Independent permutations, as related to a problem of Moser and a theorem of Polya (Q2264768) (← links)
- (Q3321475) (← links)
- Constant Depth Reducibility (Q3325043) (← links)
- Horn clause queries and generalizations (Q3706528) (← links)
- Equations between Regular Terms and an Application to Process Logic (Q3713595) (← links)
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable (Q3740280) (← links)
- (Q3795228) (← links)
- Provably Difficult Combinatorial Games (Q3854623) (← links)
- Computing connected components on parallel computers (Q3867197) (← links)
- Alternation (Q3928246) (← links)
- (Q4053084) (← links)
- (Q4068063) (← links)
- (Q4127981) (← links)
- (Q4133090) (← links)
- On the power of programming features (Q4136524) (← links)
- Generalized Program Schemas (Q4160376) (← links)
- On the Solution of Moser's Problem in Four Dimensions (Q4775871) (← links)
- (Q4776814) (← links)
