Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(6)
Pavan Aduri
4
John M. Hitchcock
3
Lance Fortnow
3
N. Variyam Vinodchandran
3
Eric Allender
2
Conferences
(3)
ICALP
1
APPROX
1
TAMC
1
Journals
(3)
ECCC
3
IANDC
1
IPL
1
Keywords
(11)
Embed
Subscribe
Academic
Authors
Fengming Wang
Edit
Fengming Wang
Rutgers, The State University of New Jersey
Publications: 8
|
Citations: 38
|
G-Index: 6
|
H-Index: 2
The information is calculated based on the tens of millions of scholarly articles currently discoverable within Microsoft Academic Search. As more content gets indexed, the accuracy and completeness will continue to improve.
Interests:
Algorithms & Theory
,
Scientific Computing
,
Data Mining
View FAQ about top research area and research interests
Collaborated with
6 co-authors
from 2005 to 2011
; Cited by
18 authors
Bing
Cumulative
Annual
Order by:
Publications
(8)
BibTeX
|
RIS
|
RefWorks
Download
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Lance Fortnow
,
John M. Hitchcock
,
Aduri Pavan
,
N. V. Vinodchandran
,
Fengming Wang
Journal:
Information and Computation/information and Control - IANDC
, vol. 209, no. 4, pp. 627-636, 2011
On the power of algebraic branching programs of width two
Eric Allender
,
Fengming Wang
Journal:
Electronic Colloquium on Computational Complexity - ECCC
, vol. 18, 2011
NEXP does not have non-uniform quasi-polynomial-size ACC circuits of o(loglog n) depth
Fengming Wang
Journal:
Electronic Colloquium on Computational Complexity - ECCC
, vol. 18, 2011
NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of
Fengming Wang
Conference:
Theory and Applications of Models of Computation - TAMC
, pp. 164-170, 2011
Uniform Derandomization from Pathetic Lower Bounds
(
Citations: 1
)
Eric Allender
,
Vikraman Arvind
,
Fengming Wang
Conference:
Approximation Algorithms for Combinatorial Optimization - APPROX
, vol. 17, pp. 380-393, 2010
Order by:
Citations
(38 times by 21 publications)
Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension
(
Citations: 8
)
Joseph S. Miller
Journal:
Advances in Mathematics - ADVAN MATH
, vol. 226, no. 1, pp. 373-384, 2011
Possibilities and impossibilities in Kolmogorov complexity extraction
(
Citations: 2
)
Marius Zimand
Journal:
Computing Research Repository - CORR
, vol. abs/1104.0, 2011
On the optimal compression of sets in PSPACE
Marius Zimand
Journal:
Computing Research Repository - CORR
, vol. abs/1104.2, 2011
Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
Marius Zimand
Conference:
Annual IEEE Conference on Computational Complexity - CCC
, vol. abs/1103.5, pp. 148-156, 2011
Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences
(
Citations: 4
)
Marius Zimand
Journal:
Theory of Computing Systems / Mathematical Systems Theory - MST
, vol. 46, no. 4, pp. 707-722, 2010
Comments