N. V. Vinodchandran

From MaRDI portal
Person:439935

Available identifiers

zbMath Open vinodchandran.n-variyamMaRDI QIDQ439935

List of research outcomes

PublicationDate of PublicationType
Pseudodeterminism: promises and lowerbounds2023-12-08Paper
Near-optimal learning of tree-structured distributions by Chow-Liu2023-11-14Paper
Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu2023-07-06Paper
Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube2023-06-21Paper
Perfect zero knowledge: new upperbounds and relativized separations2021-12-01Paper
On Pseudodeterministic Approximation Algorithms.2021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q51164862020-08-25Paper
New bounds for the CLIQUE-GAP problem using graph decomposition theory2018-04-06Paper
A Note on the Advice Complexity of Multipass Randomized Logspace2018-03-21Paper
Solvable black-box group problems are low for PP2017-11-16Paper
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs.2017-04-25Paper
Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs2016-09-22Paper
Algorithms for k-median Clustering over Distributed Streams2016-09-02Paper
Directed Planar Reachability Is in Unambiguous Log-Space2015-09-24Paper
Kolmogorov Complexity in Randomness Extraction2015-09-24Paper
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory2015-09-16Paper
On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape2015-09-16Paper
On optimal language compression for sets in PSPACE/poly2015-07-20Paper
\textsc{ReachFewL} = \textsc{ReachUL}2014-09-25Paper
On the power of unambiguity in log-space2012-12-27Paper
Kolmogorov Complexity in Randomness Extraction.2012-10-24Paper
Green's theorem and isolation in planar graphs2012-10-11Paper
Space complexity of perfect matching in bounded genus bipartite graphs2012-08-17Paper
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.2012-01-23Paper
ReachFewL = ReachUL2011-08-17Paper
Extracting Kolmogorov complexity with applications to dimension zero-one laws2011-04-28Paper
The complexity of exactly learning algebraic concepts2010-04-27Paper
Fundamentals of Computation Theory2010-04-20Paper
2-local random reductions to 3-valued functions2010-03-15Paper
AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly2009-07-09Paper
On reoptimizing multi-class classifiers2009-03-31Paper
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws2009-03-12Paper
Relations between average-case and worst-case complexity2008-06-06Paper
Some Results on Average-Case Hardness Within the Polynomial Hierarchy2008-04-17Paper
Partial bi-immunity, scaled dimension, and NP-completeness2008-04-03Paper
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy2007-10-18Paper
Fundamentals of Computation Theory2006-10-20Paper
Dimension, entropy rates, and compression2006-06-30Paper
Computational depth: Concept and applications2006-04-28Paper
Entropy rates and finite-state dimension2006-03-20Paper
Derandomizing Arthur-Merlin games using hitting sets2006-02-08Paper
A note on the circuit complexity of PP2005-12-29Paper
NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES2005-12-15Paper
Computing and Combinatorics2005-06-15Paper
Counting Complexity of Solvable Black-Box Group Problems2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q44839152003-05-27Paper
https://portal.mardi4nfdi.de/entity/Q45112212000-10-30Paper
Exact learning via teaching assistants2000-08-21Paper
The counting complexity of group-definable languages2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q49386672000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q43700331998-11-29Paper
Solvable black-box group problems are low for PP1998-07-22Paper
A note on Mod and generalised Mod classes1997-02-28Paper
A note on SpanP functions1994-08-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: N. V. Vinodchandran